Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

DOI10.4230/LIPICS.MFCS.2020.2OpenAlexW3046947725MaRDI QIDQ5089159FDOQ5089159

Authors: S. Cabello 

Publication date: 18 July 2022

Full work available at URL: http://dro.dur.ac.uk/31476/

zbMATH Keywords

fixed-parameter tractabilitygeometric graphsmaximum matchingbarrier resiliencestochastic computational geometry

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Computational topology. An introduction
• Minimum Cell Connection in Line Segment Arrangements
• Title not available (Why is that?)
• An optimal algorithm for intersecting line segments in the plane
• The complexity of counting in sparse, regular, and planar graphs
• Closest pair and the post office problem for stochastic points
• Stochastic minimum spanning trees in Euclidean spaces
• Geometry helps in bottleneck matching and related problems
• Title not available (Why is that?)
• Range searching with efficient hierarchical cuttings
• Maximum matchings in planar graphs via Gaussian elimination
• Maximum matching in graphs with an excluded minor
• On the complexity of barrier resilience for fat regions and bounded ply
• Hardness of minimum barrier shrinkage and minimum installation path
• Minimum shared‐power edge cut
• Computing the Expected Value and Variance of Geometric Measures
• Title not available (Why is that?)

Cited In (1)

• Open problems from the 2018 Summer Workshop on Lattice Polytopes at Osaka University

This page was built for publication: Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089159)