102 search results - page 3 / 21 » Dually Chordal Graphs |
90
Voted
DAM
2000
15 years 7 days ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...
78
Voted
ALGORITHMICA
2010
15 years 17 days ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
96
Voted
ITCC
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
119
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
WG
2009
Springer
15 years 7 months ago
2009
Springer
