2356 search results - page 24 / 472 » Characterizations of postman sets |
116
Voted
ENDM
2008
15 years 1 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
103
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
An enormous amount of information available via the Internet exists. Much of this data is in the form of text-based documents. These documents cover a variety of topics that are v...
137
click to vote
NETWORKS
2006
15 years 1 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
111
Voted
AC
2003
Springer
15 years 7 months ago
2003
Springer
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...
88
Voted
CONCUR
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...