1736 search results - page 69 / 348 » On antimagic directed graphs |
CSR
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
GD
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
FUZZIEEE
2007
IEEE
14 years 5 months ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
ISCAS
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...