search result

Cover von Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Year: 2018
Media group: LIPIcs
Cover von Data Reduction for Maximum Matching on Real-World Graphs

Data Reduction for Maximum Matching on Real-World Graphs

Theory and Experiments
Year: 2018
Media group: LIPIcs
Cover von On the Tractability of Optimization Problems on H-Graphs

On the Tractability of Optimization Problems on H-Graphs

Year: 2018
Media group: LIPIcs
Cover von Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence

Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence

Year: 2018
Media group: LIPIcs
Cover von Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs

Author: Yang, Kuan
Year: 2018
Media group: LIPIcs
Cover von Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region

Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region

Year: 2018
Media group: LIPIcs
Cover von Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Year: 2018
Media group: LIPIcs
Cover von On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface

Year: 2018
Media group: LIPIcs
Cover von An Improved Isomorphism Test for Bounded-Tree-Width Graphs

An Improved Isomorphism Test for Bounded-Tree-Width Graphs

Year: 2018
Media group: LIPIcs
Cover von Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs

Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0