2010/11/26 by Y. Métivier, Yves Métivier, J. M. Robson +4 · 1 citation
Computer Science · Mathematics · #Algorithm #Binary logarithm #Bounded function #Chordal graph #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Constant (computer programming) #Cryptography and Data Security #Deterministic algorithm #Discrete mathematics #Graph #Mathematics #Maximal independent set #Modulo #Multiplicative function #Privacy-Preserving Technologies in Data #Randomized algorithm #Time complexity #Upper and lower bounds #Vertex (graph theory) #Vertex cover
paper · doi:10.1007/s00446-010-0121-5
openalex publication_date 2010/11/26 · crossref created 2010/11/26 · crossref issued 2010/11/27 · crossref published 2010/11/27 · crossref published-online 2010/11/27 · crossref published-print 2011/04/01 · crossref deposited 2019/06/06 · openalex created_date 2025/10/10 · crossref indexed 2026/06/25 · openalex updated_date 2026/07/23