106 search results - page 2 / 22 » Edge clique graphs and some classes of chordal graphs |
WG
1993
Springer
13 years 9 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
WADS
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
DAM
2006
13 years 5 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
TALG
2008
13 years 5 months ago
2008
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 ...