Sciweavers

Share
1229 search results - page 1 / 246
» Linear Probing and Graphs
Sort
View
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
10 years 3 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
INFOCOM
2009
IEEE
10 years 5 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
WG
2007
Springer
10 years 4 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
9 years 10 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
9 years 10 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
books