1493 search results - page 6 / 299 » Local resilience of graphs |
WIMOB
2007
IEEE
14 years 1 months ago
2007
IEEE
— In a Mobile Ad hoc NETwork (MANET), mobile devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its networkin...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
LATIN
2004
Springer
14 years 29 days ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
ICT
2004
Springer
14 years 1 months ago
2004
Springer
The Resilient Packet Ring IEEE 802.17 is an evolving standard for the construction of Local and Metropolitan Area Networks. The RPR protocol scales to the demands of future packet ...
FUIN
2007
13 years 7 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...