117 search results - page 3 / 24 » Polarity of chordal graphs |
ALGORITHMICA
2010
14 years 9 months 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...
74
Voted
ITCC
2003
IEEE
15 years 2 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...
95
Voted
ESA
2005
Springer
15 years 3 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 4 months ago
2009
Springer
DM
2006
14 years 9 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...