Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-Free Graphs

SIAM Journal on Computing - United States
doi 10.1137/s0097539795282377
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Vertex Ranking of Asteroidal Triple-Free Graphs

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1998English

Vertex Ranking of Asteroidal Triple-Free Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs

2012English

Linear Separation of Connected Dominating Sets in Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

More Algorithms for All-Pairs Shortest Paths in Weighted Graphs

2007English

Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

2020English

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

SIAM Journal on Discrete Mathematics
Mathematics
1996English

Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy