3757 search results - page 394 / 752 » The overlap number of a graph |
179
click to vote
SPAA
2005
ACM
16 years 10 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
221
click to vote
PDCAT
2005
Springer
16 years 7 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
151
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
175
Voted
SIGCOMM
1992
ACM
15 years 10 months ago
1992
ACM
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
180
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...