1736 search results - page 15 / 348 » On antimagic directed graphs |
CORR
2009
Springer
15 years 3 months ago
2009
Springer
160
click to vote
FOCS
1999
IEEE
15 years 10 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...
161
click to vote
MFCS
2005
Springer
15 years 11 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...
160
click to vote
ICC
2007
IEEE
16 years 10 days 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...