Search results

Jump to navigation Jump to search
  • | pagename = Graph theory | abc = Graph theory
    2 KB (232 words) - 17:54, 4 August 2008
  • * [[Forest]]s in a [[Graph theory|graph]].
    2 KB (334 words) - 16:29, 7 February 2009
  • {{r|Graph theory}}
    1 KB (144 words) - 00:13, 21 January 2011
  • {{r|Graph theory}}
    430 bytes (56 words) - 21:08, 11 January 2010
  • My academic interests include combinatorics, graph theory, algorithms, cryptography, cognitive science, and programming language desi
    570 bytes (76 words) - 04:21, 22 November 2023
  • {{r|Graph theory}}
    551 bytes (71 words) - 18:22, 11 January 2010
  • {{r|Graph theory}}
    2 KB (262 words) - 19:07, 11 January 2010
  • {{r|Graph theory}}
    590 bytes (76 words) - 16:02, 11 January 2010
  • ...nce|Computer Science]], '''register allocation by graph coloring''' is a [[graph theory|graph theoretic]] solution to the [[register allocation]] problem.
    9 KB (1,338 words) - 10:00, 16 July 2013
  • In [[graph theory]], '''graph coloring''' is an arbitrary assignment of labels (''colors'') t ...early always assumed to be '''proper''', meaning that no two [[glossary of graph theory|adjacent]] vertices are assigned the same color.
    14 KB (2,315 words) - 00:35, 9 February 2010
  • ...ungarian-American mathematician [[Paul Erdős]] and are an application of [[graph theory]], a field in which he published extensively. They treat collaboration amon
    2 KB (370 words) - 12:51, 11 February 2013
  • ...branches are [[algebraic combinatorics]] and [[extremal combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.
    1 KB (165 words) - 10:24, 18 June 2009
  • ...thwest National Laboratory doing research and development in the fields of Graph Theory, Network Science and Information Visualization. I was one of the principal
    1 KB (192 words) - 04:13, 22 November 2023
  • ...hematics, operations research, and decision making. Their subjects include graph theory and its applications, nonlinear mathematics, analytical planning, and game
    3 KB (359 words) - 11:52, 13 February 2009
  • The collection of all these chains may be represented by a [[graph theory|directed graph]], with the various subgroups as nodes and the relation <ma
    9 KB (1,510 words) - 21:04, 15 January 2009
  • Robert Tarjan is known for his pioneering work on graph theory algorithms and data structures. Some of his well-known algorithms include t
    5 KB (696 words) - 22:43, 11 February 2010
  • </ref>. It is related to mathematical [[Graph Theory]].
    5 KB (792 words) - 16:47, 2 August 2008
  • ...ve important applications to [[number theory]], [[arithmetic geometry]], [[graph theory]], and [[dynamical systems]], to name a few examples. The Riemann zeta fun
    7 KB (1,113 words) - 10:50, 4 October 2013
  • ...of the complex XML data struture, without having to traverse the complex [[graph theory|tree]] that makes up XML document.
    5 KB (741 words) - 18:36, 12 August 2008
  • {{rpl|Graph theory}}
    5 KB (728 words) - 10:53, 7 March 2024
View ( | ) (20 | 50 | 100 | 250 | 500)