A special case for subset interconnection designs (Q1377654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complexity of subset interconnection designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and Subset Interconnection Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for the subset interconnection design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank

Latest revision as of 10:30, 28 May 2024

scientific article
Language Label Description Also known as
English
A special case for subset interconnection designs
scientific article

    Statements