Titlebook: Combinatorial Algorithms; 21st International W Costas S. Iliopoulos,William F. Smyth Conference proceedings 2011 Springer Berlin Heidelberg

Accessible

Obligatory

Six Lectures on Commutative Algebralem is to minimize |.(.,. ∖ .)|/(|.||. ∖ .|) over all subsets . ⊂ .. While this variant of the sparsest cut problem is often assumed to be NP-hard, this note contains the first proof of this fact. We also prove that the problem is polynomially solvable for graphs of bounded treewidth.

OGLE

暴露他抗议

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes, problem in restricted graph classes. In the present paper, we analyse two techniques that have previously been used to solve the problem in polynomial time for graphs in particular classes and apply these techniques to develop fpt-algorithms for graphs in some classes where the problem remains NP-complete.

星星

Goblet-Cells

Upper and Lower I/O Bounds for Pebbling ,-Pyramids, on the number of I/O steps to do so. The .-pyramid graph models financial applications which are of practical interest and where minimizing memory traffic can have a significant impact on cost saving.

Ingratiate

The Complexity Status of Problems Related to Sparsest Cuts,lem is to minimize |.(.,. ∖ .)|/(|.||. ∖ .|) over all subsets . ⊂ .. While this variant of the sparsest cut problem is often assumed to be NP-hard, this note contains the first proof of this fact. We also prove that the problem is polynomially solvable for graphs of bounded treewidth.

Reverie

Efficient Connectivity Testing of Hypercubic Networks with Faults,still connected? Even though the answer to this question is negative in general, we describe an algorithm which resolves this problem for the .-dimensional hypercube in time .(|.|n.). Furthermore, we sketch a more general algorithm that is efficient for graph classes with good vertex expansion properties.

使困惑

Dennis Potter: The Angel in Us,umber of nodes in ., . is the height of ., and . is the word length. We also discuss a modification of our algorithm for the unordered tree homeomorphism problem, which corresponds to a tree pattern matching problem for XPath queries with descendant axis only.

micturition