4865 search results - page 260 / 973 » The Complexity of Graph Connectivity |
132
Voted
CPAIOR
2007
Springer
16 years 13 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...
155
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...
167
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...
170
click to vote
CPC
2006
15 years 6 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
165
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...