Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267): Difference between revisions

From MaRDI portal
Importer (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 / cites work
 
Property / cites work: Minconvex Factors of Prescribed Size in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum vertex coverage problem on bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \textsc{max quasi-independent set} problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Densest k-Subgraph Approximation on Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-edge subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Upper Bounds for Partial Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Densest k-Subgraph in Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Sparsest k-Subgraph in Chordal Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
scientific article

    Statements

    Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparsest \(k\)-subgraph
    0 references
    approximation algorithm
    0 references
    chordal graphs
    0 references