Minimum node disjoint path covering for circular-arc graphs
type: Item
instance of: scholarly article
title: Minimum node disjoint path covering for circular-arc graphs
zbMATH Open document ID: 0405.68044
DOI: 10.1016/0020-0190(79)90011-5
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3630220
zbMATH Keywords: Circular-Arcgraphs
zbMATH Keywords: Node Disjoint Path Cover
zbMATH Keywords: Time Complexity
zbMATH Keywords: Np- Complete
zbMATH Keywords: Hamiltonian Path Problem
author: Maurizio A. Bonuccelli
author: Daniel P. Bovet
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90011-5
OpenAlex ID: W1963840573
cites work: Q3941433
cites work: Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Q4198056
cites work: Algorithms on circular-arc graphs
cites work: Q4142698
description: scientific article; zbMATH DE number 3630220