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

doi 10.1137/1.9781611975031.91
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

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

2020English

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

SIAM Journal on Computing
MathematicsComputer Science
2002English

Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Packing, Counting and Covering Hamilton Cycles in Random Directed Graphs

Israel Journal of Mathematics
Mathematics
2017English

Directed and Antidirected Hamiltonian Cycles and Paths in Bipartite Graphs

Banach Center Publications
1989English

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

Theta-Graphs and Other Constrained Spanners

English

Graphs of Prescribed Girth and Bi-Degree

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy