Algorithms for maximum independent set in convex bipartite graphs (Q1017904)

From MaRDI portal
Revision as of 14:23, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for maximum independent set in convex bipartite graphs
scientific article

    Statements

    title
    Algorithms for maximum independent set in convex bipartite graphs (English)
    0 references
    author
    J. Martínez
    0 references
    published in
    Algorithmica
    0 references
    publication date
    13 May 2009
    0 references
    zbMATH DE Number
    5553459
    0 references
    zbMATH Keywords
    convex bipartite graphs
    0 references
    independent sets
    0 references
    BSP/CGM algorithms
    0 references
    parallel algorithm
    0 references
    OpenAlex ID
    W2101075550
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1017904&oldid=35107705"
    Powered by MediaWiki