1101 search results - page 23 / 221 » An Algorithm for the Graph Crossing Number Problem |
108
click to vote
SLS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
ALGORITHMICA
2006
14 years 10 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
114
click to vote
ALGORITHMICA
2002
14 years 9 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...