Search
Now showing items 1-10 of 2192
The Graph Sandwich Problem for P-4-sparse graphs
(Elsevier Science BvAmsterdamHolanda, 2009)
Algorithms for clique-independent sets on subclasses of circular-arc graphs
(ELSEVIER, 2006-08-15)
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set ...
Packing triangles in low degree graphs and indifference graphs
(ELSEVIER SCIENCE BV, 2008)
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known ...
Algorithms for Maximum Independent Set in Convex Bipartite Graphs
(SPRINGER, 2009)
A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a ...
Recognizing clique graphs of directed edge path graphs
(Elsevier Science BvAmsterdamHolanda, 2003)
Covergence and divergence of the iterated biclique graph
(Wiley, 2013-06)
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G, denoted by KB(G), is the intersection graph of the bicliques of G. We say that a graph G diverges (or converges or is ...
Exact Algorithms for the Graph Coloring Problem
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2018)
A LINEAR-TIME ALGORITHM FOR PROPER INTERVAL GRAPH RECOGNITION
(Elsevier Science BvAmsterdamHolanda, 1995)
On minimal forbidden subgraph characterizations of balanced graphs
(Elsevier Science, 2013-09)
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such ...