Complexité de l'arboricité linéaire d'un graphe II

DOI10.1051/ro/1985190302931zbMath0608.05029MaRDI QIDQ3748293

Bernard Peroche

Publication date: 1985

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104885

zbMATH Keywords

linear arboricity; NP completeness

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Graph factors and factorization: 1985--2003: a survey, Unnamed Item