Algorithms for (0, 1,d)-graphs withdconstrains

DOI10.1080/00207160802562523MaRDI QIDQ5747711zbMATH OpenOpenAlexFDO

Authors Yueping Li, Dingjun Lou, Yunting Lu

Publication date 14 September 2010

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160802562523

zbMATH Keywords

algorithmsaugmentationextendabilitymatchingstrong connectivity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity
• Algorithms for the constrained maximum-weight connected graph problem
• Algorithms for classes of graphs with bounded expansion
• Algorithms for solving problems on graphs of bounded pathwidth
• scientific article; zbMATH DE number 4016952
• Fast algorithms for constrained graph density problems
• Constraints in graph drawing algorithms
• Algorithms and bounds for drawing directed graphs
• Approximation algorithms for constructing some required structures in digraphs
• Algorithms for Perfectly Contractile Graphs

Cites work

• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• A note on internally disjoint alternating paths in bipartite graphs
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs
• Characterizing defect n-extendable bipartite graphs with different connectivities
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Extending matchings in graphs: A survey
• Generalization of matching extensions in graphs
• Generalization of matching extensions in graphs. II.
• How to Make a Square Grid Framework with Cables Rigid
• On n-extendable graphs

Cited in

(1)

• scientific article; zbMATH DE number 13149 (Why is no real title available?)

This page was built for publication: Algorithms for (0, 1,d)-graphs withdconstrains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747711)