Sciweavers

3204 search results - page 48 / 641
» The Alcuin Number of a Graph
Sort
View
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
Reaction graph kernels predict EC numbers of unknown enzymatic reactions in plant secondary metabolism
Background: Understanding of secondary metabolic pathway in plant is essential for finding druggable candidate enzymes. However, there are many enzymes whose functions are not yet...
Hiroto Saigo, Masahiro Hattori, Hisashi Kashima, K...
JUCS
2006
94views more  JUCS 2006»
13 years 8 months ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
EJC
2008
13 years 8 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
ENDM
2008
118views more  ENDM 2008»
13 years 8 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
13 years 9 months ago
On the rectilinear crossing number of complete graphs
We prove a lower bound of 0.3288   n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner