Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q276207
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00026-015-0266-9 / rank
Normal rank
 
Property / author
 
Property / author: Trung van Pham / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963123511 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.3708 / 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: Chip-firing and the critical group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of bijections between \(G\)-parking functions and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sand-pile model and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized critical state of sandpile automaton models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for feedback problems in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback arc set in bipartite tournaments is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing and energy minimization on M-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-Firing and Rotor-Routing on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice structure of chip firing games and related models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of lattices induced by chip firing (and sandpile) dynamics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip firing and the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primer for the algebraic geometry of sandpiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing game and a partial Tutte polynomial for Eulerian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices generated by chip firing game models: criteria and recognition algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, parking functions, syzygies, and deformations of monomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum feedback arc set in reducible flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3508753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3450013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing circuits in eulerian digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Abelian sandpile models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00026-015-0266-9 / rank
 
Normal rank

Latest revision as of 04:13, 18 December 2024

scientific article
Language Label Description Also known as
English
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
scientific article

    Statements

    Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (English)
    0 references
    0 references
    0 references
    22 July 2015
    0 references
    chip-firing game
    0 references
    critical configuration
    0 references
    recurrent configuration
    0 references
    Eulerian digraph
    0 references
    feedback arc set
    0 references
    complexity
    0 references
    sandpile model
    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