scientific article

zbMATH Open0729.68003MaRDI QIDQ3355218

Andreas Schwill

Publication date: 1990

Title of this publication is not available (Why is that?)

zbMATH Keywords

processor networkscommunication pathsnonblocking graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Graph-Theoretic Concepts in Computer Science

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Exact algorithms for finding partial edge-disjoint paths 👍 👎
• Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs 👍 👎
• On Approximating Node-Disjoint Paths in Grids 👍 👎
• Efficient Algorithms for k-Disjoint Paths Problems on DAGs 👍 👎
• Graph-Theoretic Concepts in Computer Science 👍 👎

This page was built for publication:

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