On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-61576-8_96
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Computational Complexity of the Parallel Knock-Out Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs

Journal of Graph Theory
GeometryTopology
1998English

On the Complexity of the Highway Pricing Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Complexity of the Asymmetric VPN Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

On the Advice Complexity of the Set Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Markov Chains and Optimality of the Hamiltonian Cycle

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2009English

A Method to Search the Optimal Hamiltonian Cycle With a Set of Approximations for Travelling Salesman Problem

2015English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

On the Complexity of Parallel Parsing of General Context-Free Languages

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1986English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy