3471 search results - page 140 / 695 » Obstacle Numbers of Graphs |
ESCAPE
2007
Springer
14 years 1 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
PAMI
2010
13 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
WAW
2004
Springer
14 years 3 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...