Sciweavers

774 search results - page 62 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
NETWORKS
2008
13 years 9 months ago
A simple method for improving the primal simplex method for the multicommodity flow problem
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
Agustín Bompadre, James B. Orlin
ICPP
2003
IEEE
14 years 2 months ago
Hardware-Assisted Design for Fast Packet Forwarding in Parallel Routers
A hardware-assisted design, dubbed cache-oriented multistage structure (COMS), is proposed for fast packet forwarding. COMS incorporates small on-chip cache memory in its constitu...
Nian-Feng Tzeng
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
ICDCS
2005
IEEE
14 years 2 months ago
Using a Layered Markov Model for Distributed Web Ranking Computation
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
Jie Wu, Karl Aberer
AAAI
2006
13 years 10 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter