Add to ORKGWe present an efflcient algorithm for generating all maximum independent sets of a bipartite graph. Its time complexity is O (n sup 2.5 + (output size )), where n is the number of vertices of a given graph. As its application, we develop an algorithm for generating all maximum cliques of a circular-arc graph. When the graph is given in the form of a family of n arcs on a circle, this algorithm runs in O ( n sup 3.5 + (output size )) time
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality tha...
AbstractGiven a graph, in the maximum clique problem, one desires to find the largest number of vert...
AbstractA minimum clique-transversal set MCT(G) of a graph G=(V,E) is a set S⊆V of minimum cardinali...
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the...
We present efficient algorithms for generating all maximal and all maximum independent sets of an in...
[[abstract]]Let F be a family of arcs in a circle, where each arc is associated with a weight. The m...
An algorithm for finding a maximum clique in an arbitrary graph is described. The algorithm has a wo...
We present an output sensitive algorithm for computing a maximum independent set of an unweighted ci...
We present an output sensitive algorithm for computing a maximum independent set of an unweighted ci...
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a ...
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a ...
AbstractGiven the interval model of an n-vertex, e-edge circle graph G, it is shown how to find a cl...
We present an algorithm for finding a maximum weight independent set of a circle graph. For a cicle ...
AbstractA circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc gra...
peer-reviewedWe present an output sensitive algorithm for computing a maximum independent set of an ...
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality tha...
AbstractGiven a graph, in the maximum clique problem, one desires to find the largest number of vert...
AbstractA minimum clique-transversal set MCT(G) of a graph G=(V,E) is a set S⊆V of minimum cardinali...
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the...
We present efficient algorithms for generating all maximal and all maximum independent sets of an in...
[[abstract]]Let F be a family of arcs in a circle, where each arc is associated with a weight. The m...
An algorithm for finding a maximum clique in an arbitrary graph is described. The algorithm has a wo...
We present an output sensitive algorithm for computing a maximum independent set of an unweighted ci...
We present an output sensitive algorithm for computing a maximum independent set of an unweighted ci...
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a ...
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a ...
AbstractGiven the interval model of an n-vertex, e-edge circle graph G, it is shown how to find a cl...
We present an algorithm for finding a maximum weight independent set of a circle graph. For a cicle ...
AbstractA circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc gra...
peer-reviewedWe present an output sensitive algorithm for computing a maximum independent set of an ...
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality tha...
AbstractGiven a graph, in the maximum clique problem, one desires to find the largest number of vert...
AbstractA minimum clique-transversal set MCT(G) of a graph G=(V,E) is a set S⊆V of minimum cardinali...