1736 search results - page 134 / 348 » The rank-width of Directed Graphs |
140
click to vote
COR
2006
15 years 4 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
130
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
108
Voted
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
149
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
106
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...