Problem of path connections in graphs

DOI10.1007/BF01404102zbMath0449.94032OpenAlexW2083491854MaRDI QIDQ1147682

Dima Yu. Grigoriev

Publication date: 1981

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01404102

zbMATH Keywords

NP-completenesspath connectionsprinted circuit design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Cites Work

• Unnamed Item

This page was built for publication: Problem of path connections in graphs