4865 search results - page 97 / 973 » The Complexity of Graph Connectivity |
FAW
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
ICDAR
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts....
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
JAIR
2008
13 years 10 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
DAM
2008
13 years 10 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...