Sciweavers

6740 search results - page 107 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
102
Voted
PERCOM
2006
ACM
16 years 3 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
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
116
Voted
ALENEX
2009
118views Algorithms» more  ALENEX 2009»
15 years 4 months ago
Solving Maximum Flow Problems on Real World Bipartite Graphs
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...
81
Voted
SOFSEM
2009
Springer
16 years 11 days ago
The Simple Reachability Problem in Switch Graphs
Klaus Reinhardt
86
Voted
STACS
2010
Springer
15 years 10 months ago
Holant Problems for Regular Graphs with Complex Edge Functions
Michael Kowalczyk, Jin-yi Cai