Sciweavers

4865 search results - page 65 / 973
» The Complexity of Graph Connectivity
Sort
View
116
Voted
OPODIS
2010
15 years 1 months ago
Reliably Detecting Connectivity Using Local Graph Traits
Alejandro Cornejo, Nancy A. Lynch
94
Voted
DM
2011
180views Education» more  DM 2011»
14 years 10 months ago
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
121
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