684 search results - page 65 / 137 » A characterization of b-perfect graphs |
113
click to vote
DNA
2006
Springer
15 years 5 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
113
click to vote
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
128
click to vote
APWEB
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
138
click to vote
EJC
2008
15 years 2 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
136
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
Ontology summarization is very important to quick understanding and selection of ontologies. In this paper, we study extractive summarization of ontology. We propose a notion of R...