3267 search results - page 143 / 654 » Generalized quasirandom graphs |
123
click to vote
SIROCCO
2008
15 years 6 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
131
Voted
ICIAR
2007
Springer
15 years 10 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
155
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
129
Voted
HCW
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
151
Voted
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...