21984 search results - page 627 / 4397 » C |
192
click to vote
DAM
2006
15 years 7 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
175
click to vote
SIAMDM
2008
15 years 7 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...
155
click to vote
SIAMJO
2008
15 years 7 months ago
2008
By considering the epigraphs of conjugate functions, we extend the Fenchel duality, applicable to a (possibly infinite) family of proper lower semicontinuous convex functions on a ...
174
click to vote
SOCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
187
click to vote
JCT
2007
15 years 7 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...