Rankings of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 437538 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 219228 (Why is no real title available?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- scientific article; zbMATH DE number 975401 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Graph theory with applications
- On a graph partition problem with application to VLSI layout
- On an edge ranking problem of trees and graphs
- Optimal node ranking of tree in linear time
- Optimal node ranking of trees
- The Comparability Graph of a Tree
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
Cited in
(6)
This page was built for publication: Rankings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184378)