A graphic generalization of arithmetic.
Khan, Bilal, Bhutani, Kiran R., Kahrobaei, Delaram (2007)
Integers
Similarity:
Displaying similar documents to “Flows on the join of two graphs”
A graphic generalization of arithmetic.
Nowhere-zero -flows of supergraphs.
Mohar, Bojan, Škrekovski, Riste (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Exploiting the structure of conflict graphs in high level synthesis
Klaus Jansen (1994)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.
Antisymmetric flows and strong colourings of oriented graphs
J. Nešetřill, André Raspaud (1999)
Annales de l'institut Fourier
Similarity:
The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic colouring number and oriented chromatic number, have been recently intensely studied. For the purpose of duality, we define the notions of strong-oriented colouring and antisymmetric-flow. An antisymmetric-flow is a flow with values in an additive abelian group which uses no opposite elements of the group. We prove that the strong-oriented chromatic number (as the modular...
Nowhere-zero 3-flows in squares of graphs.
Xu, Rui, Zhang, Cun-Quan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: