3008 search results - page 200 / 602 » Independence in connected graphs |
136
click to vote
CPAIOR
2007
Springer
16 years 23 days ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
160
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
174
click to vote
ENDM
2010
15 years 6 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
172
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
221
click to vote
IPPS
2007
IEEE
16 years 27 days ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...