945 search results - page 10 / 189 » Graph Types |
SIAMDM
2008
14 years 11 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
JACM
2000
14 years 11 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
101
click to vote
SIGDOC
2000
ACM
15 years 4 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
FASE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
101
click to vote
ECOOP
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...