267 search results - page 1 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
GD
2005
Springer
13 years 10 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
SIGMETRICS
2009
ACM
13 years 9 months ago
2009
ACM
WG
2005
Springer
13 years 10 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
IPL
2007
13 years 4 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...