Simple efficient graph compression schemes for dense and complement graphs

DOI10.1023/A:1009720402326zbMath0954.90040MaRDI QIDQ1288471

Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng

Publication date: 9 February 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

dense graphscomplement graphsgraph compression schemes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27)

Related Items (2)

Simple DFS on the complement of a graph and on partially complemented digraphs ⋮ Speeding up Graph Algorithms via Switching Classes

This page was built for publication: Simple efficient graph compression schemes for dense and complement graphs