Lower bounds for combinatorial problems on graphs

DOI10.1016/0196-6774(85)90008-2zbMath0576.68035OpenAlexW2114312806MaRDI QIDQ3696519

Nobuji Saito, Hiroyuki Nakayama, Takao Nishizeki

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90008-2

zbMATH Keywords

travelling salesmandecision treesubgraph detection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Heuristic and exact algorithms for the spanning tree detection problem

This page was built for publication: Lower bounds for combinatorial problems on graphs