Clique partitions, graph compression and speeding-up algorithms
From MaRDI portal
Publication:1900930
DOI10.1006/jcss.1995.1065zbMath0831.68073OpenAlexW1972978715MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
On counting point-hyperplane incidences, A survey of the all-pairs shortest paths problem and its variants in graphs, Properties of vector embeddings in social networks, Succinct posets, View disassembly: A rewrite that extracts portions of views, Linear-Time Approximation for Maximum Weight Matching, Graph compression by BFS, Algorithms for dense graphs and networks on the random access computer, A fast scaling algorithm for the weighted triangle-free 2-matching problem, Speeding up Graph Algorithms via Switching Classes, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, Unnamed Item, A simple reduction from maximum weight matching to maximum cardinality matching, A network game with attackers and a defender, The complexity for partitioning graphs by monochromatic trees, cycles and paths, 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, Path factors and parallel knock-out schemes of almost claw-free graphs, An improved approximation algorithm for the partial Latin square extension problem., Parallel algorithms for bipartite matching problems on distributed memory computers, Vertex disjoint paths on clique-width bounded graphs, An information-theoretic framework for the lossy compression of link streams, Algorithms for unipolar and generalized split graphs, Approximate labelled subtree homeomorphism, Representation Complexities of SemiAlgebraic Graphs, Covering a Tree by a Forest, Distance-Preserving Subgraphs of Interval Graphs, Unnamed Item, Unnamed Item, Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases, Faster algorithms for half-integral T -Path packing, The maximum clique problem
