4865 search results - page 372 / 973 » The Complexity of Graph Connectivity |
162
Voted
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
155
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
179
click to vote
ADBIS
2010
Springer
15 years 8 months ago
2010
Springer
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process...
136
click to vote
IPL
2006
15 years 6 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
134
click to vote
RSA
2002
15 years 6 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...