3008 search results - page 133 / 602 » Independence in connected graphs |
181
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
152
click to vote
PLDI
2004
ACM
15 years 12 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
173
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
164
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
185
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...