1749 search results - page 187 / 350 » Conditional colorings of graphs |
157
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
166
click to vote
FORTE
1994
15 years 8 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
186
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
218
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
194
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Current state-of-the-art image-based scene reconstruction
techniques are capable of generating high-fidelity 3D
models when used under controlled capture conditions.
However, th...