And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-017-2666-1 / rank
Normal rank
 
Property / author
 
Property / author: Carlos Vinícius G. C. Lima / rank
Normal rank
 
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / rank
Normal rank
 
Property / author
 
Property / author: Carlos Vinícius G. C. Lima / rank
 
Normal rank
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / 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.1007/s10479-017-2666-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2764281430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hull number of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level distributed detection algorithm of AND/OR deadlocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geodetic sets formed by boundary vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with few \(P_4\)'s under the convexity of paths of order three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Carathéodory number of the \(P_3\) convexity of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the complexity of and/or graph solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of the hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and recognition of Radon-independent sets in split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes beyond APX / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized competitive algorithm for evaluating priced AND/OR trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimal Solutions to AND/OR Series-Parallel Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-017-2666-1 / rank
 
Normal rank

Latest revision as of 00:12, 11 December 2024

scientific article
Language Label Description Also known as
English
And/or-convexity: a graph convexity based on processes and deadlock models
scientific article

    Statements

    And/or-convexity: a graph convexity based on processes and deadlock models (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2018
    0 references
    graph convexity
    0 references
    deadlock
    0 references
    AND-OR model
    0 references
    and/or graphs
    0 references

    Identifiers

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