Sciweavers

4865 search results - page 65 / 973
» The Complexity of Graph Connectivity
Sort
View
108
Voted
OPODIS
2010
15 years 20 days ago
Reliably Detecting Connectivity Using Local Graph Traits
Alejandro Cornejo, Nancy A. Lynch
85
Voted
DM
2011
180views Education» more  DM 2011»
14 years 9 months ago
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
99
Voted
WINET
2010
95views more  WINET 2010»
14 years 9 months ago
Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
115
Voted
ACSC
2007
IEEE
15 years 9 months ago
Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
Lin Tian, Tadao Takaoka