1736 search results - page 15 / 348 » On antimagic directed graphs |
CORR
2009
Springer
13 years 5 months ago
2009
Springer
CPC
2010
13 years 5 months ago
2010
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...