Graph powers and graph homomorphisms.
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “More on the complexity of cover graphs”
Graph powers and graph homomorphisms.
Partially directed Moore graphs
Juraj Bosák (1979)
Mathematica Slovaca
Similarity:
Complexity aspects of the Helly property: graphs and hypergraphs.
Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on outerplanarity of product graphs
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
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.