On the parallel complexity of the alternating Hamiltonian cycle problem
From MaRDI portal
Publication:6567696
DOI10.1007/3-540-61576-8_96zbMATH Open1543.68265MaRDI QIDQ6567696
Ioannis Milis, E. Bampis, Yannis Manoussakis
Publication date: 5 July 2024
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved parallel algorithm for maximal matching
- Matching is as easy as matrix inversion
- Alternating Hamiltonian cycles
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Hamiltonian circuits determining the order of chromosomes
- Cycles and paths in bipartite tournaments with spanning configurations
- Graphs with Hamiltonian cycles having adjacent lines different colours
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Graph folding and programmable logic array
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- The Parallel Evaluation of General Arithmetic Expressions
- A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments
- Paths, Trees, and Flowers
This page was built for publication: On the parallel complexity of the alternating Hamiltonian cycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567696)
