Reduktion von Präzedenzstrukturen

DOI10.1007/BF01920260zbMath0343.90004MaRDI QIDQ4111262

Hartmut Noltemeier

Publication date: 1976

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Decision theory (91B06) Graph theory (05Cxx)

Related Items

Discrete ordering relations ⋮ The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finding shortest paths in nonnegative networks
• Probleme und Methoden für schlichte Funktionen
• Gaussian elimination is not optimal
• An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
• Depth-First Search and Linear Graph Algorithms