Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique detection for nondirected graphs: Two new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum cliques in arbitrary and in special graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node covering algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687254 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127305881 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(00)00053-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038174373 / rank
 
Normal rank

Latest revision as of 09:22, 30 July 2024

scientific article; zbMATH DE number 1704552
Language Label Description Also known as
English
Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
scientific article; zbMATH DE number 1704552

    Statements

    Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2002
    0 references
    maximum clique
    0 references
    branch and bound
    0 references
    braiding
    0 references

    Identifiers