2430 search results - page 274 / 486 » Computing Tutte Polynomials |
114
click to vote
FCT
1999
Springer
15 years 8 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
116
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
140
click to vote
LICS
1998
IEEE
15 years 8 months ago
1998
IEEE
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
154
click to vote
ICCS
1998
Springer
15 years 8 months ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
112
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...