Sciweavers

3757 search results - page 115 / 752
» The overlap number of a graph
Sort
View
DM
2007
101views more  DM 2007»
14 years 10 months ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans
ARSCOM
2008
110views more  ARSCOM 2008»
14 years 8 months ago
Total Perfect Codes in Tensor Products of Graphs
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
ICPR
2008
IEEE
15 years 4 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
WABI
2009
Springer
156views Bioinformatics» more  WABI 2009»
15 years 4 months ago
Phylogenetic Comparative Assembly
Recent high throughput sequencing technologies are capable of generating a huge amount of data for bacterial genome sequencing projects. Although current sequence assemblers succes...
Peter Husemann, Jens Stoye
IFIP
1992
Springer
15 years 2 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski