966 search results - page 40 / 194 » Small Alliances in Graphs |
ALENEX
2004
13 years 10 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
ESA
1999
Springer
14 years 28 days ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
SCAM
2003
IEEE
14 years 1 months ago
2003
IEEE
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
GECCO
2006
Springer
14 years 9 days ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
MLDM
2007
Springer
14 years 2 months ago
2007
Springer
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...