Clique partitions, graph compression and speeding-up algorithms
From MaRDI portal
Publication:1900930
DOI10.1006/jcss.1995.1065zbMath0831.68073MaRDI QIDQ1900930
Publication date: 25 October 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1065
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases, The complexity for partitioning graphs by monochromatic trees, cycles and paths, An improved approximation algorithm for the partial Latin square extension problem., A network game with attackers and a defender, Path factors and parallel knock-out schemes of almost claw-free graphs, Approximate labelled subtree homeomorphism, The maximum clique problem, On counting point-hyperplane incidences, Algorithms for dense graphs and networks on the random access computer, Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees, All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time, Vertex disjoint paths on clique-width bounded graphs, View disassembly: A rewrite that extracts portions of views, Covering a Tree by a Forest
