Pages that link to "Item:Q4240135"
From MaRDI portal
The following pages link to On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs (Q4240135):
Displaying 21 items.
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Approximating the longest paths in grid graphs (Q719276) (← links)
- Heuristic search for Hamilton cycles in cubic graphs (Q864114) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- Simple algorithm for finding a second Hamilton cycle (Q890906) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Optimal multi-TDMA scheduling in ring topology networks (Q1666713) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- (Q3115591) (← links)
- Approximating Alternative Solutions (Q3511329) (← links)
- On the Power of Planned Infections in Networks (Q4985791) (← links)
- (Q5089192) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
- Approximate and randomized algorithms for computing a second Hamiltonian cycle (Q6614106) (← links)
