Inapproximability results related to monophonic convexity (Q499364): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1932474
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rudini Menezes Sampaio / 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.2014.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039031503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On slowly percolating sets of minimal size in bootstrap percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Percolation Time in Two-Dimensional Bootstrap Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to clique minimal separator decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results related to monophonic convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex sets in graphs. II: Minimal path convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Distance Geometry and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connected monophonic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Revision as of 19:54, 10 July 2024

scientific article
Language Label Description Also known as
English
Inapproximability results related to monophonic convexity
scientific article

    Statements

    Inapproximability results related to monophonic convexity (English)
    0 references
    0 references
    0 references
    0 references
    30 September 2015
    0 references
    monophonic convexity
    0 references
    bipartite graphs
    0 references
    NP-completeness
    0 references
    inapproximability
    0 references
    convexity number
    0 references
    percolation time
    0 references

    Identifiers