7 search results - page 1 / 2 » Dominating Cliques in Distance-Hereditary Graphs |
161
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
133
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
184
Voted
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
147
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
128
click to vote
NIPS
2004
15 years 5 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...