Pages that link to "Item:Q1029330"
From MaRDI portal
The following pages link to Linear connectivity problems in directed hypergraphs (Q1029330):
Displaying 17 items.
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- Flow hypergraph reducibility (Q643016) (← links)
- On finding hypercycles in chemical reaction networks (Q998585) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Optimal directed hypergraph traversal with ant-colony optimisation (Q2200670) (← links)
- Directed hypergraphs and Horn minimization (Q2404615) (← links)
- Problems concerning global connectivity of directed graphs (Q2816056) (← links)
- (Q3617662) (← links)
- α-Derivable digraphs and its application in wireless sensor networking (Q4965899) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465880) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
- Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard (Q6121418) (← links)
- Persistent hyperdigraph homology and persistent hyperdigraph Laplacians (Q6154221) (← links)
- Chemically inspired Erdős-Rényi hypergraphs (Q6579168) (← links)
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\) (Q6599814) (← links)