I/O-Optimal Algorithms for Outerplanar Graphs

Journal of Graph Algorithms and Applications - United States
doi 10.7155/jgaa.00082
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Journal of Graph Algorithms and Applications

Related search

External Memory Algorithms for Outerplanar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

On List-Coloring Extendable Outerplanar Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2012English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Algorithms for Routing in Planar Graphs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
1986English

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

2020English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

An I/O-Efficient Distance Oracle for Evolving Real-World Graphs

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy