A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q115198414 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ergm.graphlets / 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.1007/978-3-030-86838-3_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201541230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum height elimination trees for interval graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved equivalence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bisection with Pareto-Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex rankings of graphs and its relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reordering sparse matrices for parallel elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:05, 29 July 2024

scientific article
Language Label Description Also known as
English
A heuristic approach to the treedepth decomposition problem for large graphs
scientific article

    Statements

    Identifiers