Sciweavers

Share
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
9 years 8 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
ISAAC
2009
Springer
87views Algorithms» more  ISAAC 2009»
9 years 8 months ago
Parameterizing Cut Sets in a Graph by the Number of Their Components
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
Takehiro Ito, Marcin Kaminski, Daniël Paulusm...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
9 years 8 months ago
Induced Packing of Odd Cycles in a Planar Graph
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
Petr A. Golovach, Marcin Kaminski, Daniël Pau...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
9 years 10 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...
ISAAC
2009
Springer
245views Algorithms» more  ISAAC 2009»
9 years 10 months ago
Pattern Matching for 321-Avoiding Permutations
Sylvain Guillemot, Stéphane Vialette
ISAAC
2009
Springer
168views Algorithms» more  ISAAC 2009»
9 years 10 months ago
On the Camera Placement Problem
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
Rudolf Fleischer, Yihui Wang
ISAAC
2009
Springer
108views Algorithms» more  ISAAC 2009»
9 years 10 months ago
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...
Li Chen, Bin Fu
ISAAC
2009
Springer
133views Algorithms» more  ISAAC 2009»
9 years 10 months ago
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
Robert Franke, Ignaz Rutter, Dorothea Wagner
books