Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal

DOI10.61091/jcmcc121-08zbMATH Open1545.05204MaRDI QIDQ6586648

Jobby Jacob, Bonnie C. 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Max-optimal and sum-optimal labelings of graphs
• On an edge ranking problem of trees and graphs
• On a graph partition problem with application to VLSI layout
• Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
• \(l_p\)-optimal rankings and max-optimal rankings are different
• Optimal edge ranking of trees in polynomial time
• Minimal rankings and the arank number of a path
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• On-line ranking number for cycles and paths
• On $\ell_p$-Support Vector Machines and Multidimensional Kernels
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Minimal rankings

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)