136 search results - page 4 / 28 » On Touching Triangle Graphs |
150
click to vote
ECCC
2006
15 years 5 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
158
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
115
click to vote
SIAMDM
2008
15 years 5 months ago
2008
We show that every triangle-free graph on the double torus is 4-colorable. This settles a problem raised by Gimbel and Thomassen [Trans. Amer. Math. Soc. 349 (1997), 4555
174
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
156
click to vote
ICIP
2010
IEEE
15 years 3 months ago
2010
IEEE
A novel interactive segmentation framework comprising of a two stage s-t mincut is proposed. The framework has been designed keeping in mind the need to segment touching neuronal ...