Fully Decomposable Split Graphs

13 years 12 months ago

Download lita.sciences.univ-metz.fr

We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable.

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginge

Real-time Traffic

Algorithms | Connected Parts | IWOCA 2009 | Polynomial Time Algorithm | Split Graph |

claim paper

» Hjoin decomposable graphs and algorithms with runtime single exponential in rankwidth

» Antimagic labeling and canonical decomposition of graphs

» Layout decomposition for double patterning lithography

» Liverange unsplitting for faster optimal coalescing

» Layout Decomposition Approaches for Double Patterning Lithography

» Approximately Counting Embeddings into Random Graphs

» Exact Covariance Thresholding into Connected Components for LargeScale Graphical Lasso

» Decomposition Techniques for Subgraph Matching

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	IWOCA
Authors	Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger

Comments (0)

Sciweavers

Fully Decomposable Split Graphs

Algorithms | Connected Parts | IWOCA 2009 | Polynomial Time Algorithm | Split Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers