2612 search results - page 196 / 523 » Switching Graphs and Their Complexity |
125
click to vote
ECCC
2006
15 years 4 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 ...
149
Voted
KDD
2010
ACM
15 years 2 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, ...
145
click to vote
SSS
2010
Springer
15 years 2 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...
171
Voted
TKDE
2012
13 years 6 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...
235
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...