9842 search results - page 136 / 1969 » The Complexity of the Matching-Cut Problem |
DAGSTUHL
1997
13 years 11 months ago
1997
Analyzing structure in complex time dependent flow fields is a challenging problem. This paper describes the use of spot noise for the visualization of this type of fields. Spo...
SIAMDM
2008
13 years 10 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
AI
2005
Springer
13 years 10 months ago
2005
Springer
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
SIAMCOMP
2000
13 years 10 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
SIAMSC
2008
13 years 8 months ago
2008
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...