Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A polynomial-time algorithm for near-unanimity graphs - MaRDI portal

A polynomial-time algorithm for near-unanimity graphs (Q3022752)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for near-unanimity graphs
scientific article

    Statements

    title
    A polynomial-time algorithm for near-unanimity graphs (English)
    0 references
    author
    Benoit Larose
    0 references
    Cynthia Loten
    0 references
    László Zádori
    0 references
    publication date
    30 June 2005
    0 references
    zbMATH DE Number
    2184161
    0 references
    zbMATH Keywords
    Near-unanimity operation
    0 references
    Reflexive graph
    0 references
    Polynomial-time algorithm
    0 references
    OpenAlex ID
    W1992517803
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3022752&oldid=31494196"
    Powered by MediaWiki