Cycle-connected mixed graphs and related problems

DOI10.1007/978-3-030-92681-6_47OpenAlexW4206590069MaRDI QIDQ5918728

Junran Lichen

Publication date: 29 June 2022

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_47

zbMATH Keywords

combinatorial optimizationexact algorithmscircuit-connected mixed graphscycle-connected mixed graphscycle-connectivity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On several sorts of 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
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The cubic graphs with finite cyclic vertex connectivity larger than girth
• 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
• 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
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Cycle-connected mixed graphs and related problems