On the parallel complexity of the alternating Hamiltonian cycle problem
From MaRDI portal
Publication:6567696
Recommendations
- On the parallel complexity of the alternating Hamiltonian cycle problem
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- scientific article; zbMATH DE number 718675
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
Cites work
- scientific article; zbMATH DE number 4049453 (Why is no real title available?)
- scientific article; zbMATH DE number 3257168 (Why is no real title available?)
- A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Alternating Hamiltonian cycles
- An improved parallel algorithm for maximal matching
- Cycles and paths in bipartite tournaments with spanning configurations
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Graph folding and programmable logic array
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Hamiltonian circuits determining the order of chromosomes
- Matching is as easy as matrix inversion
- Paths, Trees, and Flowers
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- The Parallel Evaluation of General Arithmetic Expressions
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)
