Matroid representation of clique complexes (Q2381814): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.dam.2007.05.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986664537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and homology of flag complexes and vector representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of line graphs: (X, Y)-intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The roots of the independence polynomial of a clawfree graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing matchings as the intersection of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of independent \(k\)-sets in a claw free graph / 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: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique complex and hypergraph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination numbers and homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity of some classes of the combinatorial optimization games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:47, 26 June 2024

scientific article
Language Label Description Also known as
English
Matroid representation of clique complexes
scientific article

    Statements

    Matroid representation of clique complexes (English)
    0 references
    0 references
    0 references
    0 references
    19 September 2007
    0 references
    0 references
    Abstract simplicial complex
    0 references
    clique complex
    0 references
    flag complex
    0 references
    independence system
    0 references
    matroid intersection
    0 references
    partition matroid
    0 references
    0 references