Add to ORKGA subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A a connected component of G-N[a] exists containing A\backslash{a} . An asteroidal set of cardinality three is called asteriodal triple and graphs without an asteriodal triple are called AT-free . The maximum cardinality of an asteroidal set of G , denoted by \an(G) , is said to be the asteriodal number of G . We present a scheme for designing algorithms for triangulation problems on graphs. As a consequence, we obtain algorithms to compute graph parameters such as treewidth, minimum fill-in and vertex ranking number. The running time of these algorithms is a polynomial (of degree asteriodal number plus a small constant) in the number of vertices and the num...
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of t...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection ...
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A a connected co...
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A, the set A∖{a}...
. An independent set of three vertices such that each pair is joined by a path that avoids the neigh...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
AbstractWe present an O(n2.376) algorithm for recognizing claw-free AT-free graphs and a linear-time...
Abstract. An asteroidal triple (AT) is a set of three vertices such that there is a path between any...
AbstractAn asteroidal triple of a graph G is a triple of mutually independent vertices such that, be...
We present the first polynomial time algorithms for solving the NP-complete graph problems DOMINATIN...
AbstractWe present O(n5R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-i...
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of t...
Abstract. An asteroidal triple is an independent set of three ver-tices in a graph such that every t...
AbstractAn asteroidal triple is an independent set of vertices such that each pair is joined by a pa...
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of t...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection ...
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A a connected co...
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A, the set A∖{a}...
. An independent set of three vertices such that each pair is joined by a path that avoids the neigh...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
AbstractWe present an O(n2.376) algorithm for recognizing claw-free AT-free graphs and a linear-time...
Abstract. An asteroidal triple (AT) is a set of three vertices such that there is a path between any...
AbstractAn asteroidal triple of a graph G is a triple of mutually independent vertices such that, be...
We present the first polynomial time algorithms for solving the NP-complete graph problems DOMINATIN...
AbstractWe present O(n5R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-i...
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of t...
Abstract. An asteroidal triple is an independent set of three ver-tices in a graph such that every t...
AbstractAn asteroidal triple is an independent set of vertices such that each pair is joined by a pa...
An asteroidal triple (AT) is a set of three vertices such that there is a path between any pair of t...
AbstractWe consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algo...
The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection ...