9842 search results - page 1480 / 1969 » The Complexity of the Matching-Cut Problem |
197
click to vote
WG
2005
Springer
16 years 14 days ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
171
click to vote
ISPD
2004
ACM
16 years 13 days ago
2004
ACM
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
179
click to vote
SACMAT
2004
ACM
16 years 13 days ago
2004
ACM
In the era of Ubiquitous Computing and world–wide data transfer mobility, as an innovative aspect of professional activities, imposes new and complex problems of mobile and dist...
188
click to vote
SIGECOM
2004
ACM
16 years 13 days ago
2004
ACM
We introduce new online models for two important aspects of modern financial markets: Volume Weighted Average Price trading and limit order books. We provide an extensive study o...
163
click to vote
AIS
2004
Springer
16 years 12 days ago
2004
Springer
The paper proposes three dimensional extension to High Level ARchitecture (HLA) and Runtime Infrastructure (RTI) to solve several issues such as security, information hiding proble...