Fast Sequential and Parallel Vertex Relabelings of Km,m

DOI10.1142/s0129054115500021zbMath1312.05120OpenAlexW1980468504MaRDI QIDQ5250275

Sanpawat Kantabutra

Publication date: 19 May 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054115500021

zbMATH Keywords

complexitygraph algorithmsgraph relabeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Bounds for sorting by prefix reversal
• Graph puzzles, homotopy, and the alternating group
• Parallel Prefix Computation
• The Parallel Evaluation of General Arithmetic Expressions
• On the complexity of the Edge Label Placement problem
• Optimal edge ranking of trees in linear time

This page was built for publication: Fast Sequential and Parallel Vertex Relabelings of K_m,m