Sciweavers

4865 search results - page 65 / 973

» The Complexity of Graph Connectivity

27

OPODIS
2010

98views Distributed And Parallel Com...» more OPODIS 2010»

Reliably Detecting Connectivity Using Local Graph Traits

13 years 8 months ago

Reliably Detecting Connectivity Using Local Graph Traits

Download dspace.mit.edu

Alejandro Cornejo, Nancy A. Lynch

claim paper

Read More »

19

DM
2011

180views Education» more DM 2011»

Large cycles in 4-connected graphs

13 years 5 months ago

Large cycles in 4-connected graphs

Download www.qzuss.com

M. Zh. Nikoghosyan, Zh. G. Nikoghosyan

claim paper

Read More »

21

SIAMDM
2010

89views more SIAMDM 2010»

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

13 years 5 months ago

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

Download www.math.uiuc.edu

Suil O, Sebastian M. Cioaba

claim paper

Read More »

27

WINET
2010

95views more WINET 2010»

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

13 years 5 months ago

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

Download hal.inria.fr

Afonso Ferreira, Alfredo Goldman, Julian Monteiro

claim paper

Read More »

33

ACSC
2007
IEEE

107views Theoretical Computer Science» more ACSC 2007»

Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs

14 years 4 months ago

Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs

Download crpit.com

This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The ﬁrst part introduces higher-order decomposition. ...

Lin Tian, Tadao Takaoka

claim paper

Read More »

« Prev « First page 65 / 973 Last » Next »