A linear fixed parameter tractable algorithm for connected pathwidth

This scheme is proposed by [14] to design a subexponential fixed-parameter algorithm of Partial Vertex Cover with respect to k, which is also not a bidimensional problem,

  Algebraic graph theory associates algebraic objects (e.g., the degree, adjacency, incidence and Laplacian matrices) to graphs   Spectral graph theory studies the

You should be able to just click on the link above, and bookmark the new page when you get there. (You may be asked whether you trust the book’s

A plane embedding P(G) of a planar graph G has no interior faces if and only if G is acyclic, that is, if and only if the connected components of G are

For each of the resulting notions, one can compute a decomposition of width at most d (if one exists) in time f (d) · |O| c with f a computable function and c an integer

Along with their applications to dynamic graph algorithms, topology trees can be used in situations in which a dynamic tree is part of a static graph; for instance, topology trees

Given that finding an optimal allocation of the goods in a combinatorial and/or constrained auction is in general intractable, researchers have been concerned with exposing

Finally, if G F has entwined cycles (set of cycles with common edges), we have designed a deterministic fixed-parameter algorithm for #2SAT, that is, an algorithm whose time