On the 2-Club Polytope of Graphs (Q2957469): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MCODE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
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.1287/opre.2016.1500 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2442815085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer models and upper bounds for the 3‐club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for finding \(k\)-clubs in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and heuristics for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based marketing: identifying likely adopters via consumer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Editing Graphs into 2-Club Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxation Models in Social Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique relaxation models in network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of finding small-diameter subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum \(k\)-club problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Based Clique Relaxations in Networks: s-Clique and s-Club / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:00, 13 July 2024

scientific article
Language Label Description Also known as
English
On the 2-Club Polytope of Graphs
scientific article

    Statements

    On the 2-Club Polytope of Graphs (English)
    0 references
    0 references
    0 references
    26 January 2017
    0 references
    \(k\)-club
    0 references
    clique relaxations
    0 references
    2-club polytope
    0 references
    social network analysis
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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