217 search results - page 18 / 44 » Constructing Incremental Sequences in Graphs |
146
click to vote
CPC
2007
15 years 3 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
133
Voted
ISBI
2006
IEEE
15 years 10 months ago
2006
IEEE
Automated detection of stable fracture points in a sequence of Computed Tomography (CT) images is found to be a challenging task. In this paper, an innovative scheme for automatic...
146
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
147
Voted
PASTE
2005
ACM
15 years 9 months ago
2005
ACM
UML sequence diagrams are commonly used to represent the interactions among collaborating objects. Reverse-engineered sequence diagrams are constructed from existing code, and hav...
134
Voted
SIAMDM
2011
14 years 11 months ago
2011
Abstract. A generalized Davenport–Schinzel sequence is one over a finite alphabet that excludes subsequences isomorphic to a fixed forbidden subsequence. The fundamental proble...