Complexity of finding dense subgraphs (Q1613384): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum dispersion problem in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:22, 4 June 2024

scientific article
Language Label Description Also known as
English
Complexity of finding dense subgraphs
scientific article

    Statements

    Complexity of finding dense subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2002
    0 references
    regular graph
    0 references
    dense subgraph problem
    0 references

    Identifiers