Minimal fill in O(\(n^{2.69}\)) time (Q819828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jeremy P. Spinrad / rank
Normal rank
 
Property / author
 
Property / author: Jeremy P. Spinrad / 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.disc.2005.12.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984781387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A wide-range algorithm for minimal triangulation from an arbitrary ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / 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
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Minimal fill in O(\(n^{2.69}\)) time
scientific article

    Statements

    Identifiers