Maxwell's equations in curved spacetime: Difference between revisions
Jump to navigation
Jump to search
en>Cydebot m Robot - Moving category Fundamental physics concepts to Category:Concepts in physics per CFD at Wikipedia:Categories for discussion/Log/2012 July 12. |
en>Solomonfromfinland |
||
| Line 1: | Line 1: | ||
In [[graph theory]], '''path coloring''' usually refers to one of two problems: | |||
* The problem of coloring a [[multiset|(multi)set]] of [[path (graph theory)|paths]] <math>R</math> in graph <math>G</math>, in such a way that any two paths of <math>R</math> which share an edge in <math>G</math> receive different colors. Set <math>R</math> and graph <math>G</math> are provided at input. This formulation is equivalent to [[Graph coloring|vertex coloring]] the ''conflict graph'' of set <math>R</math>, i.e. a graph with vertex set <math>R</math> and edges connecting all pairs of paths of <math>R</math> which are not edge-disjoint with respect to <math>G</math>. | |||
* The problem of coloring (in accordance with the above definition) any chosen [[multiset|(multi)set]] <math>R</math> of paths in <math>G</math>, such that the set of pairs of end-vertices of paths from <math>R</math> is equal to some set or multiset <math>I</math>, called a ''set of requests''. Set <math>I</math> and graph <math>G</math> are provided at input. This problem is a special case of a more general class of graph routing problems, known as [[call scheduling]]. | |||
In both the above problems, the goal is usually to minimise the number of colors used in the coloring. In different variants of path coloring, <math>G</math> may be a [[simple graph]], [[directed graph|digraph]] or [[multigraph]]. | |||
==References== | |||
*[http://citeseer.ist.psu.edu/erlebach00complexity.html] ''The Complexity of Path Coloring and Call Scheduling'' by Thomas Erlebach and Klaus Jansen | |||
*[http://www.nada.kth.se/~viggo/wwwcompendium/node122.html] ''A compendium of NP optimization problems'' by Viggo Kann (problem: Minimum Path Coloring) | |||
[[Category:Graph coloring]] | |||
{{Combin-stub}} | |||
Revision as of 06:31, 29 January 2014
In graph theory, path coloring usually refers to one of two problems:
- The problem of coloring a (multi)set of paths in graph , in such a way that any two paths of which share an edge in receive different colors. Set and graph are provided at input. This formulation is equivalent to vertex coloring the conflict graph of set , i.e. a graph with vertex set and edges connecting all pairs of paths of which are not edge-disjoint with respect to .
- The problem of coloring (in accordance with the above definition) any chosen (multi)set of paths in , such that the set of pairs of end-vertices of paths from is equal to some set or multiset , called a set of requests. Set and graph are provided at input. This problem is a special case of a more general class of graph routing problems, known as call scheduling.
In both the above problems, the goal is usually to minimise the number of colors used in the coloring. In different variants of path coloring, may be a simple graph, digraph or multigraph.