A polyhedral study of the maximum edge subgraph problem (Q5916096): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4945528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the maximum edge subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest \(k\)-subgraph problem on clique graphs / 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: Cardinality constrained Boolean quadratic polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approximation algorithm for the densest \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the generalized vertex packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank

Latest revision as of 22:38, 5 July 2024

scientific article; zbMATH DE number 6109905
Language Label Description Also known as
English
A polyhedral study of the maximum edge subgraph problem
scientific article; zbMATH DE number 6109905

    Statements

    A polyhedral study of the maximum edge subgraph problem (English)
    0 references
    0 references
    0 references
    22 November 2012
    0 references
    polyhedral combinatorics
    0 references
    quasi-cliques
    0 references
    maximum edge subgraph problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references