1736 search results - page 148 / 348 » On antimagic directed graphs |
227
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
127
click to vote
DM
1999
15 years 6 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
284
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
163
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
170
click to vote
AUIC
2005
IEEE
16 years 5 days ago
2005
IEEE
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...