9842 search results - page 288 / 1969 » The Complexity of the Matching-Cut Problem |
140
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
139
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
101
Voted
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
172
Voted
DAWAK
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
132
Voted
METAINFORMATICS
2004
Springer
15 years 9 months ago
2004
Springer
This paper is focusing on some interesting issues about service publicity and usability while trying to move from the classic Open Hypermedia Systems (OHSs) to structural aware env...