Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6680934 / rank
 
Normal rank
Property / zbMATH Keywords
 
directed hypergraphs
Property / zbMATH Keywords: directed hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
transitive closure
Property / zbMATH Keywords: transitive closure / rank
 
Normal rank
Property / zbMATH Keywords
 
transitive reduction
Property / zbMATH Keywords: transitive reduction / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest hyperpaths
Property / zbMATH Keywords: shortest hyperpaths / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2299844414 / 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: Linear time analysis of properties of conflict-free and general Petri nets / 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: Partially dynamic maintenance of minimum weight hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for satisfiability problems with uncertainty / 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: Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge splitting and connectivity augmentation in directed hypergraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed recursive labelnode hypergraphs: A new representation-language / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientation of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Equivalent Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hydras: complexity on general graphs and a subclass of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covers in Relational Database Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium traffic assignment for large scale transit networks / 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: Q4298260 / 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: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hydras: directed hypergraphs and Horn formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity problems in directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The joy of implications, aka pure Horn formulas: mainly a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Directed hypergraphs: introduction and fundamental algorithms -- a survey
scientific article

    Statements

    Directed hypergraphs: introduction and fundamental algorithms -- a survey (English)
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    directed hypergraphs
    0 references
    transitive closure
    0 references
    transitive reduction
    0 references
    shortest hyperpaths
    0 references
    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