On variants of vertex geography on undirected graphs (Q1627869): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129621985, #quickstatements; #temporary_batch_1724714018853
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Angelo Monti / rank
Normal rank
 
Property / author
 
Property / author: Blerina Sinaimeri / rank
Normal rank
 
Property / author
 
Property / author: Angelo Monti / rank
 
Normal rank
Property / author
 
Property / author: Blerina Sinaimeri / 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.dam.2018.05.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809575668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of path-forming games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Path Game: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial game theory foundations applied to digraph kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heap games, numeration systems and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, appeal and challenges of combinatorial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a perfect strategy for nxn chess requires time exponential in n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected edge geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129621985 / rank
 
Normal rank

Latest revision as of 00:22, 27 August 2024

scientific article
Language Label Description Also known as
English
On variants of vertex geography on undirected graphs
scientific article

    Statements

    On variants of vertex geography on undirected graphs (English)
    0 references
    3 December 2018
    0 references
    algorithmic combinatorial game theory
    0 references
    computational complexity
    0 references
    short winning strategy problems
    0 references
    undirected vertex geography
    0 references
    0 references
    0 references

    Identifiers

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