Path Problems in Structured Graphs

DOI10.1093/COMJNL/29.6.553MaRDI QIDQ3745869zbMATH OpenOpenAlexFDO

Authors Massimo Ancona, Leila De Floriani, Jitender Deogun

Publication date 1986

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/29.6.553

zbMATH Keywords

structured graphsstructured path

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Publication:4862886
• scientific article; zbMATH DE number 4147534
• scientific article; zbMATH DE number 815069
• On the computational complexity of path cover problems
• On the structure of paths-like trees

Cited in

(17)

• A framework for analysing state-abstraction methods
• Path hitting in acyclic graphs
• scientific article; zbMATH DE number 1942448 (Why is no real title available?)
• Path problems in networks
• scientific article; zbMATH DE number 1810469 (Why is no real title available?)
• scientific article; zbMATH DE number 4174987 (Why is no real title available?)
• Graph path minimization problem
• Path Problems in Complex Networks
• The Maximum Labeled Path Problem
• Using structured steiner trees for hierarchical global routing
• scientific article; zbMATH DE number 4147534 (Why is no real title available?)
• scientific article; zbMATH DE number 1340882 (Why is no real title available?)
• scientific article; zbMATH DE number 4183442 (Why is no real title available?)
• Lightweight paths in graphs
• Easy Problems for Grid-Structured Graphs
• All separating triangles in a plane graph can be optimally ``broken in polynomial time
• scientific article; zbMATH DE number 970006 (Why is no real title available?)

This page was built for publication: Path Problems in Structured Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745869)