Path Problems in Structured Graphs

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

Massimo Ancona, Jitender Deogun, Leila De Floriani

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)

Cited In (15)

• Graph path minimization problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path hitting in acyclic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Maximum Labeled Path Problem
• Using structured steiner trees for hierarchical global routing
• 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
• ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME

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)