search result

Cover von The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs

Year: 2016
Media group: LIPIcs
Cover von Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane

Year: 2016
Media group: LIPIcs
Cover von Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing

Year: 2016
Media group: LIPIcs
Cover von Subexponential Time Algorithms for Embedding H-Minor Free Graphs

Subexponential Time Algorithms for Embedding H-Minor Free Graphs

Year: 2016
Media group: LIPIcs
Cover von Near Optimal Adjacency Labeling Schemes for Power-Law Graphs

Near Optimal Adjacency Labeling Schemes for Power-Law Graphs

Year: 2016
Media group: LIPIcs
Cover von Linear-Time Recognition of Map Graphs with Outerplanar Witness

Linear-Time Recognition of Map Graphs with Outerplanar Witness

Year: 2016
Media group: LIPIcs
Cover von A Linear Kernel for Finding Square Roots of Almost Planar Graphs

A Linear Kernel for Finding Square Roots of Almost Planar Graphs

Year: 2016
Media group: LIPIcs
Cover von A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs

A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs

Year: 2016
Media group: LIPIcs
Cover von A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs

A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs

Year: 2016
Media group: LIPIcs
Cover von On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs

Year: 2016
Media group: LIPIcs
OPEN V 11.1.0.0