The \textsc{max quasi-independent set} problem (Q434194): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9343-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170054126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining market data: a network approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-edge subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Applications of Minimum Cuts in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 10:22, 5 July 2024

scientific article
Language Label Description Also known as
English
The \textsc{max quasi-independent set} problem
scientific article

    Statements

    Identifiers