Distance-preserving graph compression techniques

DOI10.7155/JGAA.V28I1.2933MaRDI QIDQ6616229zbMATH OpenFDO

Authors Amirali Madani, Anil Maheshwari

Publication date 8 October 2024

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V28I1.2933

zbMATH Keywords

contractiongraph algorithmsgraph compression

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Distance-Preserving Graph Contractions
• Distance-Preserving Graph Contractions
• The improved sliding shortest path algorithm
• Faster compression methods for a weighted graph using locality sensitive hashing
• Improved sliding shortest path algorithm: performance analysis

Cites work

• Blockers for the stability number and the chromatic number
• Blocking total dominating sets via edge contractions
• Complexity and algorithms for constant diameter augmentation problems
• Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
• Distance-Preserving Graph Contractions
• scientific article; zbMATH DE number 1759406 (Why is no real title available?)
• Minimum \(d\)-blockers and \(d\)-transversals in graphs
• Minimum vertex blocker clique problem
• On the NP-hardness of edge-deletion and -contraction problems
• Reachability preserving compression for dynamic graph
• Reducing graph transversals via edge contractions
• Reducing the domination number of graphs via edge contractions and vertex deletions
• The most vital nodes with respect to independent set and vertex cover
• The node-deletion problem for hereditary properties is NP-complete

This page was built for publication: Distance-preserving graph compression techniques

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