Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2016.07.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2016.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1801151079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and vehicle routing for municipal waste collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chinese Postman Problem for Mixed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of edge traversing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2016.07.006 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of the \(k\)-arc Chinese postman problem
scientific article

    Statements

    Identifiers