scientific article; zbMATH DE number 7561357

DOI10.4230/LIPICS.ISAAC.2018.3MaRDI QIDQ5090992FDOQ5090992

Authors: Andreas Björklund 

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

Hamiltonian cyclebipartite graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Reducibility among Combinatorial Problems
• The traveling salesman problem in bounded degree graphs
• An Improved Exact Algorithm for Cubic Graph TSP
• The Traveling Salesman Problem for Cubic Graphs
• A probabilistic remark on algebraic program testing
• Algorithms for propositional model counting
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• A simplified NP-complete satisfiability problem
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Pathwidth of cubic graphs and exact algorithms
• A bound on the pathwidth of sparse graphs with applications to exact algorithms
• Fast Hamiltonicity Checking Via Bases of Perfect Matchings
• Determinant Sums for Undirected Hamiltonicity
• Functional analysis
• Computing and Combinatorics
• Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
• Faster exponential-time algorithms in graphs of bounded average degree
• Title not available (Why is that?)

Cited In (1)

• The Asymmetric Travelling Salesman Problem In Sparse Digraphs.

This page was built for publication:

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