104 search results - page 17 / 21 » Comparative Graph Theoretical Characterization of Networks o... |
125
Voted
ECCC
2006
15 years 3 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
151
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
132
Voted
DFG
2009
Springer
15 years 10 months ago
2009
Springer
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
145
Voted
WIOPT
2005
IEEE
15 years 9 months ago
2005
IEEE
Wireless networks consist of senders, receivers, and intermediate nodes that collaborating (more or less) to establish the communication paths. Most of the researches in the domai...
132
Voted
ICNP
2006
IEEE
15 years 9 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...