Colorarea grafurilor (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Colorarea grafurilor" in Romanian language version.

refsWebsite

Global rank Romanian rank

21doi.org

2^nd place

3^rd place

19wikidata.org

43^rd place

2^nd place

2web.archive.org

1^st place

2ethz.ch

2,224^th place

2,278^th place

1acm.org

1,185^th place

2,686^th place

1psu.edu

207^th place

281^st place

acm.org

portal.acm.org

Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), „Some simplified NP-complete problems”, Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63, doi:10.1145/800119.803884 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability^⁠(d), W.H. Freeman, ISBN 0-7167-1045-5

doi.org

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

ethz.ch

dcg.ethz.ch

Schneider (2010) Schneider, J. (2010), „A new technique for distributed symmetry breaking” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017
Schneider (2008) Schneider, J. (2008), „A log-star distributed maximal independent set algorithm for growth-bounded graphs” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017

psu.edu

citeseerx.ist.psu.edu

Marx (2004) Marx, Dániel (2004), „Graph colouring problems and their applications in scheduling”, Periodica Polytechnica, Electrical Engineering, 48 (1–2), pp. 11–16, CiteSeerX 10.1.1.95.4268

web.archive.org

Schneider (2010) Schneider, J. (2010), „A new technique for distributed symmetry breaking” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017
Schneider (2008) Schneider, J. (2008), „A log-star distributed maximal independent set algorithm for growth-bounded graphs” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017

wikidata.org

Lawler (1976) Lawler, E.L. (1976), „A note on the complexity of the chromatic number problem”, Information Processing Letters^⁠(d), 5 (3): 66–67, doi:10.1016/0020-0190(76)90065-X
Björklund, Husfeldt & Koivisto (2009) Björklund, A.; Husfeldt, T.; Koivisto, M. (2009), „Set partitioning via inclusion–exclusion”, SIAM Journal on Computing^⁠(d), 39 (2): 546–563, doi:10.1137/070683933
Fomin, Gaspers & Saurabh (2007) Fomin, F.V.; Gaspers, S.; Saurabh, S. (2007), „Improved Exact Algorithms for Counting 3- and 4-Colorings”, Proc. 13th Annual International Conference, COCOON 2007, Lecture Notes in Computer Science^⁠(d), 4598, Springer, pp. 65–74, doi:10.1007/978-3-540-73545-8_9, ISBN 978-3-540-73544-1
Sekine, Imai & Tani (1995) Sekine, K.; Imai, H.; Tani, S. (1995), „Computing the Tutte polynomial of a graph of moderate size”, Proc. 6th International Symposium on Algorithms and Computation (ISAAC 1995), Lecture Notes in Computer Science^⁠(d), 1004, Springer, pp. 224–233, doi:10.1007/BFb0015427, ISBN 3-540-60573-8
Brélaz (1979) Brélaz, D. (1979), „New methods to color the vertices of a graph”, Communications of the ACM^⁠(d), 22 (4): 251–256, doi:10.1145/359094.359101
Schneider (2010) Schneider, J. (2010), „A new technique for distributed symmetry breaking” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017
Cole & Vishkin (1986), see also Cormen, Leiserson & Rivest (1990, Section 30.5) Cole, R.; Vishkin, U. (1986), „Deterministic coin tossing with applications to optimal parallel list ranking”, Information and Computation^⁠(d), 70 (1): 32–53, doi:10.1016/S0019-9958(86)80023-7 Cormen, T. H.; Leiserson, C. E.; Rivest, R. L. (1990), Introduction to Algorithms^⁠(d) (ed. 1st), The MIT Press
Goldberg, Plotkin & Shannon (1988) Goldberg, A. V.; Plotkin, S. A.; Shannon, G. E. (1988), „Parallel symmetry-breaking in sparse graphs”, SIAM Journal on Discrete Mathematics^⁠(d), 1 (4): 434–446, doi:10.1137/0401044
Schneider (2008) Schneider, J. (2008), „A log-star distributed maximal independent set algorithm for growth-bounded graphs” (PDF), Proceedings of the Principles of Distributed Computing^⁠(d), arhivat din original (PDF) la 30 iulie 2013, accesat în 20 iunie 2017
Barenboim & Elkin (2009); Kuhn (2009) Barenboim, L.; Elkin, M. (2009), „Distributed (Δ + 1)-coloring in linear (in Δ) time”, Proceedings of the 41st Symposium on Theory of Computing^⁠(d), pp. 111–120, doi:10.1145/1536414.1536432, ISBN 978-1-60558-506-2 Kuhn, F. (2009), „Weak graph colorings: distributed algorithms and applications”, Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures^⁠(d), pp. 138–144, doi:10.1145/1583991.1584032, ISBN 978-1-60558-606-9
Garey, Johnson & Stockmeyer (1974); Garey & Johnson (1979). Garey, M. R.; Johnson, D. S.; Stockmeyer, L. (1974), „Some simplified NP-complete problems”, Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47–63, doi:10.1145/800119.803884 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability^⁠(d), W.H. Freeman, ISBN 0-7167-1045-5
Dailey (1980) Dailey, D. P. (1980), „Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete”, Discrete Mathematics^⁠(d), 30 (3): 289–293, doi:10.1016/0012-365X(80)90236-8
Zuckerman (2007) Zuckerman, D. (2007), „Linear degree extractors and the inapproximability of Max Clique and Chromatic Number”, Theory of Computing^⁠(d), 3: 103–128, doi:10.4086/toc.2007.v003a006
Khot (2001) Khot, S. (2001), „Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring”, Proc. 42nd Annual Symposium on Foundations of Computer Science^⁠(d), pp. 600–609, doi:10.1109/SFCS.2001.959936, ISBN 0-7695-1116-3
Jaeger, Vertigan & Welsh (1990) Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), „On the computational complexity of the Jones and Tutte polynomials”, Mathematical Proceedings of the Cambridge Philosophical Society^⁠(d), 108: 35–53, doi:10.1017/S0305004100068936
Goldberg & Jerrum (2008) Goldberg, L. A.; Jerrum, M. (iulie 2008), „Inapproximability of the Tutte polynomial”, Information and Computation^⁠(d), 206 (7): 908–929, doi:10.1016/j.ic.2008.04.003
Holyer (1981) Holyer, I. (1981), „The NP-completeness of edge-coloring”, SIAM Journal on Computing^⁠(d), 10 (4): 718–720, doi:10.1137/0210055
Crescenzi & Kann (1998) Crescenzi, P.; Kann, V. (decembrie 1998), „How to find the best approximation results — a follow-up to Garey and Johnson”, ACM SIGACT^⁠(d), 29 (4): 90, doi:10.1145/306198.306210
Chaitin (1982) Chaitin, G. J. (1982), „Register allocation & spilling via graph colouring”, Proc. 1982 Programming Language Design and Implementation^⁠(d), pp. 98–105, doi:10.1145/800230.806984, ISBN 0-89791-074-5