Succinct representations of graphs
Information and Control
A note on succinct representations of graphs
Information and Control
Minimal representation of directed hypergraphs
SIAM Journal on Computing
Principles of artificial intelligence
Principles of artificial intelligence
Hyperpaths and shortest hyperpaths
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
On-line algorithms for satisfiability problems with uncertainty
Selected papers from the international workshop on Uncertainty in databases and deductive systems
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Packet classification using tuple space search
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Graph Algorithms for Functional Dependency Manipulation
Journal of the ACM (JACM)
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)
Proceedings of the Mathematical Foundations of Computer Science 1984
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Directed Hypergraphs as a Modelling Paradigm
Directed Hypergraphs as a Modelling Paradigm
Graphs and Hypergraphs
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
Structure theorems for optimum hyperpaths in directed hypergraphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 5.23 |
We introduce a notion of hyperconnection (formally called L-hyperpath) between vertices in a directed hypergraph and relate this notion to existing notions of hyperpaths in directed hypergraphs. We show that some interesting questions in problem domains such as distributed secret sharing and routing in packet filtered networks are basically questions about the existence of L-hyperpaths in directed hypergraphs. We study the computational complexity of problems related to L-hyperpaths and the L-cyclomatic number of directed hypergraphs (the minimum number of hyperedges that need to be deleted to make a directed hypergraph free of L-hypercycles). We prove that the L-hyperpath existence problem, the L-cyclomatic number problem, the minimum L-cyclomatic set problem, and the minimal L-cyclomatic set problem are each complete for the complexity class NP, @S"2^p, @P"2^p, and DP, respectively.