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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 01:57, 1 July 2023

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

    Identifiers

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