Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890720): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2016.05.027 / 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.1016/j.tcs.2016.05.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962899930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus algorithms for the generation of all maximal bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal bicliques in bipartite graphs with favorable degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating bicliques of a graph in lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and bipartite subgraph listing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Sets and Bicliques in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration aspects of maximal cliques and bicliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the number of bicliques in false-twin-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Iterated Biclique Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicliques in graphs. I: Bounds on their number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2016.05.027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:30, 9 December 2024

scientific article; zbMATH DE number 6588480
Language Label Description Also known as
English
Tight lower bounds on the number of bicliques in false-twin-free graphs
scientific article; zbMATH DE number 6588480

    Statements

    Identifiers