ALGORITHMS
2010
13 years 10 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
ANOR
2005
14 years 10 days ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
JGT
2006
14 years 12 days ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
JAL
2006
14 years 12 days ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
DM
2006
14 years 14 days ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
DAM
2008
14 years 15 days ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
WG
2005
Springer
14 years 6 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
ESA
2005
Springer
14 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...
CIAC
2010
Springer
14 years 9 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...