199 search results - page 1 / 40 » Recognizing HHDS-Free Graphs |
SIAMDM
2000
13 years 4 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
ALGORITHMICA
2010
13 years 4 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
APPML
2007
13 years 4 months ago
2007
FAW
2010
Springer
13 years 5 months ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
ALGORITHMICA
2006
13 years 4 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...