Sciweavers

1736 search results - page 141 / 348
» On antimagic directed graphs
Sort
View
DAM
2007
97views more  DAM 2007»
15 years 6 months ago
On Sturmian graphs
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
Chiara Epifanio, Filippo Mignosi, Jeffrey Shallit,...
FAC
2002
66views more  FAC 2002»
15 years 6 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
GLOBECOM
2008
IEEE
16 years 1 months ago
Network Formation Games for Distributed Uplink Tree Construction in IEEE 802.16J Networks
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
AIRWEB
2005
Springer
16 years 3 days ago
Optimal Link Bombs are Uncoordinated
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
Sibel Adali, Tina Liu, Malik Magdon-Ismail
WS
2004
ACM
15 years 12 months ago
Trust evaluation in ad-hoc networks
Title of Thesis: DISTRIBUTED TRUST EVALUATION IN AD-HOC NETWORKS Georgios E. Theodorakopoulos, Master of Science, 2004 Thesis directed by: Professor John S. Baras Department of El...
George Theodorakopoulos, John S. Baras