1199 search results - page 84 / 240 » Graph Theory |
137
click to vote
CATS
2006
15 years 5 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
117
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
142
click to vote
DIALM
2005
ACM
15 years 5 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
118
click to vote
ICIAR
2007
Springer
15 years 10 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
146
click to vote
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...