684 search results - page 64 / 137 » A characterization of b-perfect graphs |
108
click to vote
DMCS
2003
15 years 3 months ago
2003
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
113
click to vote
WSC
1997
15 years 3 months ago
1997
VisSim/Discrete Event is a process-oriented, discrete event modeling toolkit based on the powerful and proven graphical interface provided by the underlying VisSim simulation envi...
PAA
2006
15 years 1 months ago
2006
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...
WIOPT
2010
IEEE
15 years 8 days ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
122
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...