Search results
Jump to navigation
Jump to search
Page title matches
- ...h]]. Such objects can be vertices, edges, faces, or a mixture of those. A graph coloring is distinct from a [[graph labeling]] in that in the former, the same label ...th the general public in the form of the popular number puzzle [[Sudoku]]. Graph coloring is still a very active field of research.14 KB (2,315 words) - 00:35, 9 February 2010
- ...do justice to either. My recommendation is to write a separate article on graph coloring in mathematics, perhaps summarizing the basic terminology and results in th2 KB (277 words) - 15:17, 26 September 2007
- 160 bytes (20 words) - 08:17, 4 September 2009
- | pagename = Graph coloring | abc = Graph coloring785 bytes (75 words) - 08:33, 15 March 2024
- 12 bytes (1 word) - 15:17, 26 September 2007
- Auto-populated based on [[Special:WhatLinksHere/Graph coloring]]. Needs checking by a human. {{r|Register allocation by graph coloring}}509 bytes (65 words) - 16:58, 11 January 2010
- In [[computer science|Computer Science]], '''register allocation by graph coloring''' is a [[graph theory|graph theoretic]] solution to the [[register allocat The register allocation problem can be viewed as a [[graph coloring]] problem as follows: every variable or intermediate calculation in a prog9 KB (1,338 words) - 10:00, 16 July 2013
- 615 bytes (101 words) - 09:07, 14 November 2007
- | pagename = Register allocation by graph coloring | abc = register allocation by graph coloring721 bytes (67 words) - 06:11, 15 March 2024
- 12 bytes (1 word) - 09:07, 14 November 2007
- Auto-populated based on [[Special:WhatLinksHere/Register allocation by graph coloring]]. Needs checking by a human. {{r|Graph coloring}}586 bytes (76 words) - 19:57, 11 January 2010
Page text matches
- {{r|Graph coloring}}236 bytes (31 words) - 11:34, 19 April 2010
- {{r|Graph coloring}} {{r|Register allocation by graph coloring}}797 bytes (101 words) - 16:58, 11 January 2010
- | pagename = Register allocation by graph coloring | abc = register allocation by graph coloring721 bytes (67 words) - 06:11, 15 March 2024
- | pagename = Graph coloring | abc = Graph coloring785 bytes (75 words) - 08:33, 15 March 2024
- Auto-populated based on [[Special:WhatLinksHere/Graph coloring]]. Needs checking by a human. {{r|Register allocation by graph coloring}}509 bytes (65 words) - 16:58, 11 January 2010
- {{r|Graph coloring}} {{r|Register allocation by graph coloring}}535 bytes (70 words) - 19:57, 11 January 2010
- Auto-populated based on [[Special:WhatLinksHere/Register allocation by graph coloring]]. Needs checking by a human. {{r|Graph coloring}}586 bytes (76 words) - 19:57, 11 January 2010
- {{r|Graph coloring}} {{r|Register allocation by graph coloring}}661 bytes (87 words) - 17:04, 11 January 2010
- {{r|Graph coloring}} {{r|Register allocation by graph coloring}}1 KB (187 words) - 13:39, 29 April 2011
- ...do justice to either. My recommendation is to write a separate article on graph coloring in mathematics, perhaps summarizing the basic terminology and results in th2 KB (277 words) - 15:17, 26 September 2007
- * [[register allocation by graph coloring]]627 bytes (63 words) - 16:44, 16 February 2010
- {{r|Graph coloring}}426 bytes (55 words) - 20:41, 11 January 2010
- In [[computer science|Computer Science]], '''register allocation by graph coloring''' is a [[graph theory|graph theoretic]] solution to the [[register allocat The register allocation problem can be viewed as a [[graph coloring]] problem as follows: every variable or intermediate calculation in a prog9 KB (1,338 words) - 10:00, 16 July 2013
- {{r|Register allocation by graph coloring}}539 bytes (70 words) - 15:41, 11 January 2010
- {{r|Register allocation by graph coloring}}585 bytes (76 words) - 15:39, 11 January 2010
- {{r|Register allocation by graph coloring}}606 bytes (79 words) - 20:34, 11 January 2010
- {{r|Graph coloring}}613 bytes (77 words) - 19:56, 11 January 2010
- {{r|Register allocation by graph coloring}}669 bytes (88 words) - 17:27, 11 January 2010
- {{r|Graph coloring}} {{r|Register allocation by graph coloring}}3 KB (353 words) - 03:48, 24 September 2013
- ...h]]. Such objects can be vertices, edges, faces, or a mixture of those. A graph coloring is distinct from a [[graph labeling]] in that in the former, the same label ...th the general public in the form of the popular number puzzle [[Sudoku]]. Graph coloring is still a very active field of research.14 KB (2,315 words) - 00:35, 9 February 2010
- {{r|Register allocation by graph coloring}}794 bytes (107 words) - 13:40, 29 April 2011
- {{r|Register allocation by graph coloring}}888 bytes (123 words) - 17:03, 13 July 2008
- {{r|Graph coloring}}2 KB (206 words) - 19:38, 11 January 2010
- ...ar solution to the register allocation problem is [[register allocation by graph coloring]] as presented by Briggs in 1992.2 KB (347 words) - 00:34, 9 February 2010
- ...ssigned to the nodes, and voila! The phone companies are trying to solve a graph coloring problem.22 KB (3,572 words) - 03:09, 8 March 2024
- * [[register allocation by graph coloring]]3 KB (513 words) - 04:28, 22 November 2023
- * [[register allocation by graph coloring]]7 KB (933 words) - 16:53, 16 February 2010
- ...e a look at my talk page, Greg Woodhouse has just brought up an example [[Graph coloring]] that he thinks is properly both Computers and Math. I'll put on the [http25 KB (4,332 words) - 07:40, 25 May 2007
- [[:Category:Graph coloring|Graph coloring]] (1)80 KB (8,229 words) - 11:34, 7 March 2024
- ...Flash]], [[Grand rounds]], [[Grand Trunk Railway of Canada]], [[Grape]], [[Graph coloring]], [[Graphic design]], [[Graphics processing unit]], [[Grass]], [[Gravitati26 KB (2,742 words) - 08:39, 22 April 2024
- ...[[Regions of England]], [[Register allocation]], [[Register allocation by graph coloring]], [[Relient K]], [[Religion]], [[Religious conversion]], [[Rembetika]], [[45 KB (4,912 words) - 07:29, 24 April 2024