Cycle-connected mixed graphs and related problems

DOI10.1007/s10878-022-00979-3OpenAlexW4313880559MaRDI QIDQ5918609

Junran Lichen

Publication date: 17 January 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00979-3

zbMATH Keywords

combinatorial optimizationcombinatorial algorithmscircuit-connected mixed graphscycle-connected mixed graphscycle-connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On several sorts of connectivity
• \(k\)-linked and \(k\)-cyclic digraphs
• Pendant tree-connectivity
• The directed subgraph homeomorphism problem
• 2-linked graphs
• Highly connected non-2-linked digraphs
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• On \(k\)-strong and \(k\)-cyclic digraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The cubic graphs with finite cyclic vertex connectivity larger than girth
• Computing vertex-disjoint paths in large graphs using MAOs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Network Flow and Testing Graph Connectivity
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Computing Vertex Connectivity: New Bounds from Old Techniques
• Strong subgraph k‐connectivity
• Spectral Theory and Analysis
• Combinatorial optimization. Theory and algorithms.