Sciweavers

2 search results - page 1 / 1
» A Correspondence Between Maximal Complete Bipartite Subgraph...
Sort
View
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
13 years 10 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
INFOCOM
2007
IEEE
13 years 10 months ago
Routing and Channel Allocation in Rural Wireless Mesh Networks
— IEEE 802.11 Wi-Fi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using...
Partha Dutta, Sharad Jaiswal, Rajeev Rastogi