Article

Free access

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

Authors:

Noga Alon,

Raphy Yuster,

Uri ZwickAuthors Info & Claims

STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing

Pages 326 - 335

https://doi.org/10.1145/195058.195179

Published: 23 May 1994 Publication History

PDF eReader

References

[1]

N. Alon, J. Bruck, J. Naor, M. Naor, and R.M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38(2):509-516, 1992.

Crossref

Google Scholar

[2]

N. Alon, O. Goldreich, J. H~stad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-304, 1992. Addendum in Random Structures and Algorithms, 4(1 ):119-120, 1993.

Crossref

Google Scholar

[3]

N. Alon and M. Naor. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. To appear in Algorithmica, 1994.

Google Scholar

[4]

H.L. Bodlaender. On linear time minor tests with depth-first search. Journal of Algorithms, 14:1-23, 1993.

Digital Library

Google Scholar

[5]

B. Bollob~s. Extremal graph theory. Academic Press, 1978.

Digital Library

Google Scholar

[6]

B. Bollob~s. Extremal graph theory with emphasis on probabilistic methods. Regional conference series in mathematics, No. 62, American Mathematical Society, 1986.

Google Scholar

[7]

T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to algorithms. The MIT Press, 1990.

Digital Library

Google Scholar

[8]

N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SlAM Journal on Computing, 14:210- 223, 1985.

Digital Library

Google Scholar

[9]

R.G. Downey and M.R. Fellows. Fixedparameter intractability. In Proceedings of the 7th Annual Symposium on Structure in Complexity Theory, pages 36- 49, 1992.

Google Scholar

[10]

M.L. Fredman, J. Koml6s, and E. Szemer#di. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31:538-544, 1984.

Digital Library

Google Scholar

[11]

M. Fiirer and B. Raghavachari. Approximating the minimum degree spanning tree to within one from the optimal degree. In Proceedings of the 3rd Annual A CM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, pages 317-324, 1992.

Digital Library

Google Scholar

[12]

A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423, 1978.

Crossref

Google Scholar

[13]

D.S. Johnson. The NP-completeness column: An ongoing guide. The many faces of polynomial time. Journal of Algorithms, 8:285-303, 1987.

Digital Library

Google Scholar

[14]

D. Karger, R. Motwani, and G.D.S. Ramkumar. On approximating the longest path in a graph. In Proceedings of the Workshop on algorithms and data structures, Montreal, Canada, pages 421-432, 1993.

Digital Library

Google Scholar

[15]

D.W. Matula and L.L. Beck. Smallestlast ordering and clustering and graph coloring algorithms. Journal of the A CM, 30:417-427, 1983.

Digital Library

Google Scholar

[16]

B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 25:239-254, 1985.

Google Scholar

[17]

J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd Annual A CM Symposium on Theory of Computing, pages 213-223, 1990.

Digital Library

Google Scholar

[18]

J. Plehn and B. Voigt. Finding minimally weighted subgraphs. In Proc. 16th Workshop on graph theoretic concepts in computer Scie'nce, Lecture Notes in Computer Science, Vol. 484, pages 18-29. Springer, 1990.

Digital Library

Google Scholar

[19]

C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.

Crossref

Google Scholar

[20]

C.H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. In Proceedings of the 8th Annual Symposium on Structure in Complexity Theory, San Diego, California, pages 12-18, 1993.

Crossref

Google Scholar

[21]

D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:382-394, 1986.

Crossref

Google Scholar

[22]

N. Robertson and P. Seymour. Graph minors. II. Algorithmic aspects of treewidth. Journal of Algorithms, 7:309- 322, 1986.

Crossref

Google Scholar

[23]

N. Robertson and P. Seymour. Graph minors. V. Excluding a planar graph. journal of Combinatorial Theory, Series B, 41"92-114, 1986.

Digital Library

Google Scholar

[24]

J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19(5):775-786, 1990.

Digital Library

Google Scholar

[25]

R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 21st international Colloquium on Automata, Languages and Programming, Jerusalem, Israel, 1994. to appear.

Digital Library

Google Scholar

Cited By

View all

Ye XLi RDai QChen HWang G(2024)Efficient -Clique Counting on Large Graphs: The Power of Color-Based Sampling ApproachesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.331464336:4(1518-1536)Online publication date: Apr-2024
https://doi.org/10.1109/TKDE.2023.3314643
Yacoub TGonzález-Alemán RLeclerc Fde Beauchêne IPonty Y(2024)Color Coding for the Fragment-Based Docking, Design and Equilibrium Statistics of Protein-Binding ssRNAsResearch in Computational Molecular Biology10.1007/978-1-0716-3989-4_10(147-163)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1007/978-1-0716-3989-4_10
Ye XLi RDai QQin HWang G(2023)Efficient Biclique Counting in Large Bipartite GraphsProceedings of the ACM on Management of Data10.1145/35889321:1(1-26)Online publication date: 30-May-2023
https://doi.org/10.1145/3588932
Show More Cited By

Index Terms

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs
1. Mathematics of computing

Recommendations

On Hedetniemi's conjecture and the colour template scheme

Hedetniemi's conjecture states that the chromatic number of a product of graphs is the minimum of the chromatic numbers of the factors. El-Zahar and Sauer (Combinatorica 5 (1985) 121) have shown that the chromatic number of a product of 4-chromatic ...
Bordeaux 3-color conjecture and 3-choosability

A graph G=(V,E) is list L-colorable if for a given list assignment L={L(v):v@?V}, there exists a proper coloring c of G such that c(v)@?L(v) for all v@?V. If G is list L-colorable for every list assignment with |L(v)|>=k for all v@?V, then G is said to ...
On the existence of graphs which can colour every regular graph
Abstract
Let H and G be graphs. An H-colouring of G is a proper edge-colouring f : E ( G ) → E ( H ) such that for any vertex u ∈ V ( G ) there exists a vertex v ∈ V ( H ) with f ∂ G u = ∂ H v, where ∂ G u and ∂ H v respectively denote the sets ...

Comments

Information & Contributors

Information

Published In

STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing

May 1994

822 pages

ISBN:0897916638

DOI:10.1145/195058

Chairmen:
F. Tom Leighton
Massachusetts Institue of Technology, Cambridge
,
Michael Goodrich
Johns Hopkins Univ., Baltimore, MD

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC94

Sponsor:

SIGACT

STOC94: Symposium on Theory of Computing

May 23 - 25, 1994

Quebec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
1,346
Total Downloads

Downloads (Last 12 months)154
Downloads (Last 6 weeks)22

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ye XLi RDai QChen HWang G(2024)Efficient -Clique Counting on Large Graphs: The Power of Color-Based Sampling ApproachesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.331464336:4(1518-1536)Online publication date: Apr-2024
https://doi.org/10.1109/TKDE.2023.3314643
Yacoub TGonzález-Alemán RLeclerc Fde Beauchêne IPonty Y(2024)Color Coding for the Fragment-Based Docking, Design and Equilibrium Statistics of Protein-Binding ssRNAsResearch in Computational Molecular Biology10.1007/978-1-0716-3989-4_10(147-163)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1007/978-1-0716-3989-4_10
Ye XLi RDai QQin HWang G(2023)Efficient Biclique Counting in Large Bipartite GraphsProceedings of the ACM on Management of Data10.1145/35889321:1(1-26)Online publication date: 30-May-2023
https://doi.org/10.1145/3588932
Bishnu AGhosh AKolay SMishra GSaurabh S(2023)Almost optimal query algorithm for hitting set using a subset queryJournal of Computer and System Sciences10.1016/j.jcss.2023.02.002137(50-65)Online publication date: Nov-2023
https://doi.org/10.1016/j.jcss.2023.02.002
Maiti ADey PPelachaud CTaylor MFaliszewski PMascardi V(2022)Parameterized Algorithms for Kidney ExchangeProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems10.5555/3535850.3536079(1693-1695)Online publication date: 9-May-2022
https://dl.acm.org/doi/10.5555/3535850.3536079
Mitra SBiswas SAcharyya S(2021)Application of Meta-Heuristics on Reconstructing Gene Regulatory Network: A Bayesian Model ApproachIETE Journal of Research10.1080/03772063.2021.194643369:7(4184-4195)Online publication date: 4-Jul-2021
https://doi.org/10.1080/03772063.2021.1946433
Abu-Khzam FAl Kontar K(2020)A Brief Survey of Fixed-Parameter ParallelismAlgorithms10.3390/a1308019713:8(197)Online publication date: 14-Aug-2020
https://doi.org/10.3390/a13080197
Chen XDathathri RGill GPingali K(2020)PangolinProceedings of the VLDB Endowment10.14778/3389133.338913713:8(1190-1205)Online publication date: 3-May-2020
https://dl.acm.org/doi/10.14778/3389133.3389137
Probst Gutenberg MVassilevska Williams VWein NMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)New algorithms and hardness for incremental single-source shortest paths in directed graphsProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384236(153-166)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384236
Altieri FHansen TVandin F(2019)NoMAS: A Computational Approach to Find Mutated Subnetworks Associated With Survival in Genome-Wide Cancer StudiesFrontiers in Genetics10.3389/fgene.2019.0026510Online publication date: 10-Apr-2019
https://doi.org/10.3389/fgene.2019.00265
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On Hedetniemi's conjecture and the colour template scheme

Bordeaux 3-color conjecture and 3-choosability

On the existence of graphs which can colour every regular graph