Graphs whose l_p-optimal rankings are l_ optimal

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

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)

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

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)

Cites Work

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

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)