Graphs whose l_p-optimal rankings are l_ optimal

DOI10.61091/jcmcc121-08MaRDI QIDQ6586648zbMATH OpenFDO

Authors Bonnie C. Jacob, Jobby Jacob

Publication date 13 August 2024

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

ranking\(l_p\) norm\(l_p\)-optimal ranking\(l_{\infty}\) normmax optimal ranking

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Recommendations

• \(l_p\)-optimal rankings and max-optimal rankings are different
• Max-optimal and sum-optimal labelings of graphs
• Infinite graphs with finite \(l_p\)-rank number: a characterization
• Minimal rankings
• Ranking numbers of graphs

Cites work

• scientific article; zbMATH DE number 219228 (Why is no real title available?)
• scientific article; zbMATH DE number 6253899 (Why is no real title available?)
• Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
• Max-optimal and sum-optimal labelings of graphs
• Minimal rankings
• Minimal rankings and the arank number of a path
• On \(\ell_p\)-support vector machines and multidimensional kernels
• On a graph partition problem with application to VLSI layout
• On an edge ranking problem of trees and graphs
• On-line ranking number for cycles and paths
• Optimal edge ranking of trees in polynomial time
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Role of Elimination Trees in Sparse Factorization
• \(l_p\)-optimal rankings and max-optimal rankings are different

This page was built for publication: Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586648)