1952 search results - page 221 / 391 » Complete partitions of graphs |
164
click to vote
ADMA
2008
Springer
15 years 8 months ago
2008
Springer
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
161
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
172
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
176
click to vote
ENTCS
2008
15 years 6 months ago
2008
In model-based software development, a complete design and analysis process involves designing the system using the design language, converting it into the analysis language, and ...
161
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in ...