Search Sciweavers | Sciweavers

6740 search results - page 107 / 1348

» An s -Hamiltonian Line Graph Problem

click to vote

PERCOM
2006
ACM

103views Computer Networks» more PERCOM 2006»

A Dynamic Graph Algorithm for the Highly Dynamic Network Problem

14 years 9 months ago

Download www.its.caltech.edu

A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...

Edwin Soedarmadji, Robert J. McEliece

claim paper

Read More »

click to vote

ALENEX
2009

118views Algorithms» more ALENEX 2009»

Solving Maximum Flow Problems on Real World Bipartite Graphs

13 years 11 months ago

Download static.googleusercontent.com

In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...

Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, B...

claim paper

Read More »

click to vote

SOFSEM
2009
Springer

90views Theoretical Computer Science» more SOFSEM 2009»

The Simple Reachability Problem in Switch Graphs

14 years 7 months ago

Download www.sofsem.cz

Klaus Reinhardt

claim paper

Read More »