Efficient enumeration of graph orientations with sources (Q1647832): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2017.08.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The acyclic orientation game on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all the acyclic orientations of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-parking functions, acyclic orientations and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Cyclic Orientations of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing Acyclic Orientations of Graphs with Single and Multiple Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directing Road Networks by Listing Strong Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of dependent arcs in an acyclic orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4584164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability and acyclic orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an Unknown Acyclic Orientation of a Given Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the Acyclic Orientations of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations with single source and sink / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2017.08.002 / rank
 
Normal rank

Latest revision as of 00:53, 11 December 2024

scientific article
Language Label Description Also known as
English
Efficient enumeration of graph orientations with sources
scientific article

    Statements

    Efficient enumeration of graph orientations with sources (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 June 2018
    0 references
    enumeration
    0 references
    acyclic orientations
    0 references
    cyclic orientations
    0 references
    delay
    0 references

    Identifiers