Path Problems in Structured Graphs

DOI10.1093/COMJNL/29.6.553zbMATH Open0607.05042OpenAlexW2064277065MaRDI QIDQ3745869FDOQ3745869

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

Recommendations

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

zbMATH Keywords

structured graphsstructured path

Mathematics Subject Classification ID

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

Cited In (17)

• Graph path minimization problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path hitting in acyclic graphs
• All separating triangles in a plane graph can be optimally ``broken in polynomial time
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Maximum Labeled Path Problem
• Title not available (Why is that?)
• Using structured steiner trees for hierarchical global routing
• Easy Problems for Grid-Structured Graphs
• A framework for analysing state-abstraction methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path problems in networks
• Path Problems in Complex Networks
• Lightweight paths in graphs

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)