Sciweavers

2270 search results - page 142 / 454
» On the distribution of eigenvalues of graphs
Sort
View
PERCOM
2006
ACM
16 years 6 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 12 months ago
On the Use of UML for Modeling Physical Systems
— The aim of this paper is to provide a unified language for modeling both control software and physical plants in real time control systems. This is done by embedding the bond ...
Cristian Secchi, Cesare Fantuzzi, Marcello Bonf&ea...
GCC
2003
Springer
15 years 11 months ago
Some Conclusions on Cayley Digraphs and Their Applications to Interconnection Networks
Abstract. In this short communication, we survey the relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups and obtain some general re...
Wenjun Xiao, Behrooz Parhami
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim