396 search results - page 74 / 80 » Exact Algorithms for Graph Homomorphisms |
AICT
2006
IEEE
15 years 8 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
98
Voted
IJCAI
1993
15 years 3 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
126
click to vote
ISMB
1994
15 years 3 months ago
1994
The automatic generation of drawings of metabolic pathways is a challenging problem that depends intimately on exactly what information has been recorded for each pathway, and on ...
130
Voted
OOPSLA
2010
Springer
14 years 11 months ago
2010
Springer
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
137
Voted
COLOGNETWENTE
2010
14 years 10 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...