3471 search results - page 177 / 695 » Obstacle Numbers of Graphs |
130
Voted
MICS
2010
14 years 11 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
160
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
120
click to vote
AE
2007
Springer
15 years 10 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
122
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
143
Voted
GD
2005
Springer
15 years 10 months ago
2005
Springer
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...