New Width Parameters of Graphs

@inproceedings{Vatshelle2012NewWP,
  title={New Width Parameters of Graphs},
  author={Martin Vatshelle},
  year={2012}
}
Abstract The main focus of this thesis is on using the divide and conquer technique toeciently solve graph problems that are in general intractable. We work inthe eld of parameterized algorithms, using width parameters of graphs thatindicate the complexity inherent in the structure of the input graph. We usethe notion of branch decompositions of a set function introduced by Robert-son and Seymour to de ne three new graph parameters, boolean-width, max-imum matching-width (MM-width) and maximum… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 44 CITATIONS

Exploring graph parameters similar to tree-width and path-width

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Maximum matching width: New characterizations and a fast algorithm for dominating set

  • Discrete Applied Mathematics
  • 2017
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Characterizing graphs of maximum matching width at most 2

  • Discrete Applied Mathematics
  • 2016
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width

  • Algorithmica
  • 2015
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Between Treewidth and Clique-Width

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Solving MaxSAT and #SAT on structured CNF formulas

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Point-width and Max-CSPs

VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Solving #SAT and MAXSAT by Dynamic Programming

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

The rank-width of the square grid

  • Discrete Applied Mathematics
  • 2010
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The Hardness of Approximating Poset Dimension

  • Electronic Notes in Discrete Mathematics
  • 2007
VIEW 1 EXCERPT

J

D. Kratsch, R. M. Mcconnell, K. Mehlhorn
  • P. Spinrad, Certifying algorithms for recognizing interval graphs and permutation graphs
  • 2003
VIEW 1 EXCERPT