5100 search results - page 378 / 1020 » The Linear Complexity of a Graph |
180
click to vote
ECCC
2006
15 years 7 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 ...
226
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
195
click to vote
SSS
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
259
click to vote
TKDE
2012
13 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
200
click to vote
ICCCN
2007
IEEE
16 years 1 months ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...