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

Lecture Notes in Computer Science - Germany
doi 10.1007/11573036_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Fast Parallel Algorithm to Recognize P4-Sparse Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1998English

Perfect Matching and Circuit Cover of Graphs

English

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

2017English

Minimal Skew Energy of Oriented Unicyclic Graphs With a Perfect Matching

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2014English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Progressive Mode-Seeking on Graphs for Sparse Feature Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Ordering of Unicyclic Graphs With Perfect Matchings by Minimal Matching Energies

Open Journal of Discrete Mathematics
2019English

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Random Subgraphs of Cayley Graphs Overp-Groups

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy