2 search results - page 1 / 1 » On the Bi-enhancement of Chordal-bipartite Probe Graphs |
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
ALGORITHMICA
2007
14 years 10 months ago
2007
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...