On testing Hamiltonicity of graphs
type: Item
instance of: scholarly article
title: On testing Hamiltonicity of graphs
zbMATH Open document ID: 1302.05098
published in: Discrete Mathematics
publication date: 2014-11-07T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6366562
zbMATH Keywords: permanent
zbMATH Keywords: Hamiltonian circuit
author: Alexander Barvinok
MaRDI profile type: Publication
full work available at URL: j.disc.2014.08.021
OpenAlex ID: W2076086942
cites work: The maximum number of Hamiltonian paths in tournaments
cites work: An approximation algorithm for counting contingency tables
cites work: Computing the Partition Function for Perfect Matchings in a Hypergraph
cites work: TSP with bounded metrics
cites work: Property testing and its connection to learning and approximation
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: On the complexity of nonnegative-matrix scaling
cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
cites work: The complexity of computing the permanent
DOI: 10.1016/J.DISC.2014.08.021
Recommended article: Q4204176
Recommended article: Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs
Recommended article: On hyper-Hamiltonicity in graphs
Recommended article: On hamiltonian‐connected graphs
Recommended article: On Computing the Hamiltonian Index of Graphs
Recommended article: On computing the Hamiltonian index of graphs
Recommended article: Q3012581
Recommended article: Q4661416
Recommended article: Q3481737
Recommended article: Q4393235
description: scientific article; zbMATH DE number 6366562