Search Sciweavers | Sciweavers

2430 search results - page 21 / 486

» Computing Tutte Polynomials

click to vote

ESA
2008
Springer

101views Algorithms» more ESA 2008»

Faster Steiner Tree Computation in Polynomial-Space

13 years 9 months ago

Download www.disp.uniroma2.it

Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...

Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch

claim paper

Read More »

click to vote

CCCG
2008

116views Computational Geometry» more CCCG 2008»

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time

13 years 9 months ago

Download www.cs.rochester.edu

Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...

Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic

claim paper

Read More »

click to vote

SIROCCO
2003

109views Information Technology» more SIROCCO 2003»

Polynomial-Time Computable Backup Tables for Shortest-Path Routing

13 years 9 months ago

Download www.lab2.kuis.kyoto-u.ac.jp

For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...

Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...

claim paper

Read More »

click to vote

GECCO
2009
Springer

76views Optimization» more GECCO 2009»

A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

14 years 2 months ago

Download www.cs.colostate.edu

Andrew M. Sutton, L. Darrell Whitley, Adele E. How...

claim paper

Read More »