796 search results - page 33 / 160 » Graph Properties Based Filtering |
76
Voted
JCO
2007
14 years 9 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
Most studies about writer identification are based on English documents and to our knowledge no research has been reported on Farsi or Arabic documents. In this paper, we have pro...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
114
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
76
Voted
CSCLP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...