On the complexity of strongly connected components in directed hypergraphs (Q517789): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029313157 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1112.1444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Subset Graph of a Collection of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Min and Max Invariants Using Max-Plus Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the vertices of tropical polyhedra using directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for polynomially solvable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Algorithms for Functional Dependency Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic maintenance of directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for dense graphs and networks on the random access computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the subset partial order for dense families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-based depth-first search for strong and biconnected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the propositional satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max Horn SAT and the minimum cut problem in directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Perron-Frobenius theorem for homogeneous, monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Plus $(A,B)$-Invariant Spaces and Control of Timed Discrete-Event Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear-time algorithms for minimal fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis for timed automata using max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding hypercycles in chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed hypergraph model for random time dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunistic algorithms for eliminating supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple sub-quadratic algorithm for computing the subset partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast bit-parallel algorithm for computing the subset partial order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity problems in directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding extremal sets in less than quadratic time / rank
 
Normal rank

Revision as of 13:44, 13 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of strongly connected components in directed hypergraphs
scientific article

    Statements

    On the complexity of strongly connected components in directed hypergraphs (English)
    0 references
    0 references
    0 references
    27 March 2017
    0 references
    directed hypergraphs
    0 references
    strongly connected components
    0 references
    minimal set problem
    0 references
    subset partial order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references