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

doi 10.1137/1.9781611974782.124
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Contractible Subgraphs in 3-Connected Graphs

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

Computing Sparse Permanents Faster

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

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Splitting Lemma for 2-Connected Graphs

ISRN Discrete Mathematics
2012English

Generating Connected and 2-Edge Connected Graphs

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

Spaghetti Labeling: Directed Acyclic Graphs for Block-Based Connected Components Labeling

IEEE Transactions on Image Processing
Computer GraphicsComputer-Aided DesignSoftware
2020English

On 2-Connected Spanning Subgraphs With Low Maximum Degree

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy