1133 search results - page 191 / 227 » Basics of Graph Cuts |
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
SPLST
2003
13 years 10 months ago
2003
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
BIB
2007
13 years 9 months ago
2007
Mathematical modelling is increasingly used to get insights into the functioning of complex biological networks. In this context, Petri nets (PNs) have recently emerged as a promi...
IJAHUC
2008
13 years 9 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
IANDC
2006
13 years 9 months ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...