Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

doi 10.1137/1.9781611975994.30
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners

2018English

Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Extremal Embedded Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Theta-Graphs and Other Constrained Spanners

English

A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

2018English

I/O-Optimal Algorithms for Outerplanar Graphs

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy