Colorazione dei grafi (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Colorazione dei grafi" in Italian language version.

refsWebsite

Global rank Italian rank

2^nd place

7^th place

799^th place

22^nd place

1web.archive.org

1^st place

1^st place

1,185^th place

1,964^th place

acm.org

portal.acm.org

Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). M. R. Garey, D. S. Johnson e L. Stockmeyer, Some simplified NP-complete problems, in Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, 1974, pp. 47–63, DOI:10.1145/800119.803884. M. R. Garey e D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979, ISBN 0-7167-1045-5.

doi.org

dx.doi.org

Björklund, Husfeldt & Koivisto (2009). A. Björklund, T. Husfeldt e M. Koivisto, Set partitioning via inclusion–exclusion, in SIAM Journal on Computing, vol. 39, n. 2009, pp. 546–563, DOI:10.1137/070683933.
Lawler (1976). E.L. Lawler, A note on the complexity of the chromatic number problem, in Information Processing Letters, vol. 5, n. 3, 1976, pp. 66–67, DOI:10.1016/0020-0190(76)90065-X.
Beigel & Eppstein (2005). R. Beigel e D. Eppstein, 3-coloring in time O(1.3289ⁿ), in Journal of Algorithms, vol. 54, 2), 2005, pp. 168–204, DOI:10.1016/j.jalgor.2004.06.008.
Fomin, Gaspers & Saurabh (2007). F.V. Fomin, S. Gaspers e S. Saurabh, Improved Exact Algorithms for Counting 3- and 4-Colorings, in Proc. 13th Annual International Conference, COCOON 2007, Lecture Notes in Computer Science, vol. 4598, Springer, 2007, pp. 65–74, DOI:10.1007/978-3-540-73545-8_9, ISBN 978-3-540-73544-1.
Sekine, Imai & Tani (1995). K. Sekine, H. Imai e S. Tani, Computing the Tutte polynomial of a graph of moderate size, in Proc. 6th International Symposium on Algorithms and Computation (ISAAC 1995), Lecture Notes in Computer Science, vol. 1004, Springer, 1995, pp. 224–233, DOI:10.1007/BFb0015427, ISBN 3-540-60573-8.
Welsh & Powell (1967). D. J. A. Welsh e M. B. Powell, An upper bound for the chromatic number of a graph and its application to timetabling problems, in The Computer Journal, vol. 10, n. 1, 1967, pp. 85–86, DOI:10.1093/comjnl/10.1.85.
Brélaz (1979). D. Brélaz, New methods to color the vertices of a graph, in Communications of the ACM, vol. 22, n. 4, 1979, pp. 251–256, DOI:10.1145/359094.359101.
Cole & Vishkin (1986), vedi anche Cormen, Leiserson & Rivest (1990), Sezione 30.5 R. Cole e U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, in Information and Control, vol. 70, n. 1, 1986, pp. 32–53, DOI:10.1016/S0019-9958(86)80023-7. T. H. Cormen, C. E. Leiserson e R. L. Rivest, Introduction to Algorithms, 1ª ed., The MIT Press, 1990.
Goldberg, Plotkin & Shannon (1988). A. V. Goldberg, S. A. Plotkin e G. E. Shannon, Parallel symmetry-breaking in sparse graphs, in SIAM Journal on Discrete Mathematics, vol. 1, n. 4, 1988, pp. 434–446, DOI:10.1137/0401044.
Barenboim & Elkin (2009); Kuhn (2009) L. Barenboim e M. Elkin, Distributed (Δ + 1)-coloring in linear (in Δ) time, in Proceedings of the 41st Symposium on Theory of Computing, 2009, pp. 111–120, DOI:10.1145/1536414.1536432, ISBN 978-1-60558-506-2. F. Kuhn, Weak graph colorings: distributed algorithms and applications, in Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, 2009, pp. 138–144, DOI:10.1145/1583991.1584032, ISBN 978-1-60558-606-9.
Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). M. R. Garey, D. S. Johnson e L. Stockmeyer, Some simplified NP-complete problems, in Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, 1974, pp. 47–63, DOI:10.1145/800119.803884. M. R. Garey e D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979, ISBN 0-7167-1045-5.
Dailey (1980). D. P. Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, in Discrete Mathematics, vol. 30, n. 3, 1980, pp. 289–293, DOI:10.1016/0012-365X(80)90236-8.
Halldórsson (1993). M. M. Halldórsson, A still better performance guarantee for approximate graph coloring, in Information Processing Letters, vol. 45, 1993, pp. 19–23, DOI:10.1016/0020-0190(93)90246-6.
Zuckerman (2007). D. Zuckerman, Linear degree extractors and the inapproximability of Max Clique and Chromatic Number, in Theory of Computing, vol. 3, 2007, pp. 103–128, DOI:10.4086/toc.2007.v003a006.
Guruswami & Khanna (2000). V. Guruswami e S. Khanna, On the hardness of 4-coloring a 3-colorable graph, in Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000, pp. 188–197, DOI:10.1109/CCC.2000.856749, ISBN 0-7695-0674-7.
Khot (2001). S. Khot, Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring, in Proc. 42nd Annual Symposium on Foundations of Computer Science, 2001, pp. 600–609, DOI:10.1109/SFCS.2001.959936, ISBN 0-7695-1116-3.
Jaeger, Vertigan & Welsh (1990). F. Jaeger, D. L. Vertigan e D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 108, 1990, pp. 35–53, DOI:10.1017/S0305004100068936.
Goldberg & Jerrum (2008). L. A. Goldberg e M. Jerrum, Inapproximability of the Tutte polynomial, in Information and Computation, vol. 206, n. 7, luglio 2008, pp. 908–929, DOI:10.1016/j.ic.2008.04.003.
Holyer (1981). I. Holyer, The NP-completeness of edge-coloring, in SIAM Journal on Computing, vol. 10, n. 4, 1981, pp. 718–720, DOI:10.1137/0210055.
Chaitin (1982). G. J. Chaitin, Register allocation & spilling via graph colouring, in Proc. 1982 SIGPLAN Symposium on Compiler Construction, 1982, pp. 98–105, DOI:10.1145/800230.806984, ISBN 0-89791-074-5.

oadoi.org

Björklund, Husfeldt & Koivisto (2009). A. Björklund, T. Husfeldt e M. Koivisto, Set partitioning via inclusion–exclusion, in SIAM Journal on Computing, vol. 39, n. 2009, pp. 546–563, DOI:10.1137/070683933.
Lawler (1976). E.L. Lawler, A note on the complexity of the chromatic number problem, in Information Processing Letters, vol. 5, n. 3, 1976, pp. 66–67, DOI:10.1016/0020-0190(76)90065-X.
Beigel & Eppstein (2005). R. Beigel e D. Eppstein, 3-coloring in time O(1.3289ⁿ), in Journal of Algorithms, vol. 54, 2), 2005, pp. 168–204, DOI:10.1016/j.jalgor.2004.06.008.
Welsh & Powell (1967). D. J. A. Welsh e M. B. Powell, An upper bound for the chromatic number of a graph and its application to timetabling problems, in The Computer Journal, vol. 10, n. 1, 1967, pp. 85–86, DOI:10.1093/comjnl/10.1.85.
Brélaz (1979). D. Brélaz, New methods to color the vertices of a graph, in Communications of the ACM, vol. 22, n. 4, 1979, pp. 251–256, DOI:10.1145/359094.359101.
Cole & Vishkin (1986), vedi anche Cormen, Leiserson & Rivest (1990), Sezione 30.5 R. Cole e U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, in Information and Control, vol. 70, n. 1, 1986, pp. 32–53, DOI:10.1016/S0019-9958(86)80023-7. T. H. Cormen, C. E. Leiserson e R. L. Rivest, Introduction to Algorithms, 1ª ed., The MIT Press, 1990.
Goldberg, Plotkin & Shannon (1988). A. V. Goldberg, S. A. Plotkin e G. E. Shannon, Parallel symmetry-breaking in sparse graphs, in SIAM Journal on Discrete Mathematics, vol. 1, n. 4, 1988, pp. 434–446, DOI:10.1137/0401044.
Dailey (1980). D. P. Dailey, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, in Discrete Mathematics, vol. 30, n. 3, 1980, pp. 289–293, DOI:10.1016/0012-365X(80)90236-8.
Halldórsson (1993). M. M. Halldórsson, A still better performance guarantee for approximate graph coloring, in Information Processing Letters, vol. 45, 1993, pp. 19–23, DOI:10.1016/0020-0190(93)90246-6.
Zuckerman (2007). D. Zuckerman, Linear degree extractors and the inapproximability of Max Clique and Chromatic Number, in Theory of Computing, vol. 3, 2007, pp. 103–128, DOI:10.4086/toc.2007.v003a006.
Jaeger, Vertigan & Welsh (1990). F. Jaeger, D. L. Vertigan e D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, in Mathematical Proceedings of the Cambridge Philosophical Society, vol. 108, 1990, pp. 35–53, DOI:10.1017/S0305004100068936.
Goldberg & Jerrum (2008). L. A. Goldberg e M. Jerrum, Inapproximability of the Tutte polynomial, in Information and Computation, vol. 206, n. 7, luglio 2008, pp. 908–929, DOI:10.1016/j.ic.2008.04.003.
Holyer (1981). I. Holyer, The NP-completeness of edge-coloring, in SIAM Journal on Computing, vol. 10, n. 4, 1981, pp. 718–720, DOI:10.1137/0210055.

web.archive.org

Schneider (2008). J. Schneider, A log-star distributed maximal independent set algorithm for growth-bounded graphs (PDF), in Proceedings of the Symposium on Principles of Distributed Computing, 2008 (archiviato dall'url originale il 30 luglio 2013).