Hyperpath deletion in directed hypergraphs

DOI10.1016/J.TCS.2026.116153MaRDI QIDQ7319291zbMATH OpenFDO

Authors Abolfazl Hassanpour, Massoud Aman

Publication date 25 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116153

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Theory of computing (68Qxx) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A column generation method for inverse shortest path problems
• A directed hypergraph model for random time dependent shortest paths
• A note on minimum makespan assembly plans
• An algorithm for ranking paths that may contain cycles
• An inverse problem of the weighted shortest path problem
• Constrained inverse minimum flow problems under the weighted Hamming distance
• Cutsets and partitions of hypergraphs
• Directed hypergraphs and applications
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Finding hypernetworks in directed hypergraphs
• Finding the K shortest hyperpaths
• High-Quality Hypergraph Partitioning
• scientific article; zbMATH DE number 4112412 (Why is no real title available?)
• Hypergraph theory. An introduction
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse Optimization
• Linear connectivity problems in directed hypergraphs
• Minimum s-t hypercut in (s, t)-planar hypergraphs
• On an instance of the inverse shortest paths problem
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• Some inverse optimization problems under the Hamming distance
• Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

This page was built for publication: Hyperpath deletion in directed hypergraphs

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