Distance-preserving graph compression techniques

DOI10.7155/JGAA.V28I1.2933MaRDI QIDQ6616229

Anil Maheshwari, Amirali Madani

Publication date: 8 October 2024

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

zbMATH Keywords

contractiongraph algorithmsgraph compression

Mathematics Subject Classification ID

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

Cites Work

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

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)