On finding \(k\)-cliques in \(k\)-partite graphs (Q360493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mohammad Mirghorbani / rank
Normal rank
 
Property / author
 
Property / author: Q360492 / rank
Normal rank
 
Property / author
 
Property / author: Mohammad Mirghorbani / rank
 
Normal rank
Property / author
 
Property / author: Pavlo A. Krokhmal / 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/s11590-012-0536-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060051654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel approximate string matching algorithms with transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-parallel witnesses and their applications to approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Studies of Randomized Multidimensional Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank

Latest revision as of 19:47, 6 July 2024

scientific article
Language Label Description Also known as
English
On finding \(k\)-cliques in \(k\)-partite graphs
scientific article

    Statements

    On finding \(k\)-cliques in \(k\)-partite graphs (English)
    0 references
    27 August 2013
    0 references
    0 references
    maximum clique enumeration problem
    0 references
    \(k\)-partite graph
    0 references
    \(k\)-clique
    0 references
    bit parallelism
    0 references
    0 references
    0 references
    0 references