NC Algorithms for Computing the Number of Perfect Matchings in K 3,3-Free Graphs and Related Problems

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-19487-8_27

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

The Number of Disjoint Perfect Matchings in Semi-Regular Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

NC Algorithms for Recognizing Chordal Graphs and K Trees

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1988English

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

Ordering of Unicyclic Graphs With Perfect Matchings by Minimal Matching Energies

Open Journal of Discrete Mathematics
2019English

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

Claw-Free Circular-Perfect Graphs

Journal of Graph Theory
GeometryTopology
2010English

Critical Chromatic Number and the Complexity of Perfect Packings in Graphs

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy