Sciweavers

14 search results - page 1 / 3
» Fully Decomposable Split Graphs
Sort
View
IWOCA
2009
Springer
119views Algorithms» more  IWOCA 2009»
14 years 23 days ago
Fully Decomposable Split Graphs
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 full...
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginge...
TALG
2008
127views more  TALG 2008»
13 years 6 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
DAM
2010
137views more  DAM 2010»
13 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
IPL
2010
160views more  IPL 2010»
13 years 4 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
14 years 3 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...