2354 search results - page 421 / 471 » Radio number for trees |
154
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
159
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
180
click to vote
JGAA
2010
15 years 4 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
172
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
130
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...