150 search results - page 23 / 30 » Polynomial graph invariants from homomorphism numbers |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
SODA
1996
ACM
14 years 11 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
100
click to vote
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
IWDC
2005
Springer
15 years 3 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
137
click to vote
ISCA
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...