The complete optimal stars-clustering-tree problem (Q2473041): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.dam.2006.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048682560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clustering matroid and the optimal clustering tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4441334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Consecutive-Retrieval Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:58, 27 June 2024

scientific article
Language Label Description Also known as
English
The complete optimal stars-clustering-tree problem
scientific article

    Statements

    The complete optimal stars-clustering-tree problem (English)
    0 references
    0 references
    0 references
    26 February 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    stars
    0 references
    clustering spanning trees
    0 references
    hypergraphs
    0 references
    polynomial graph algorithms
    0 references
    NP-hardness
    0 references
    0 references