1545 search results - page 68 / 309 » On tree congestion of graphs |
IWDC
2005
Springer
15 years 3 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
IJFCS
2007
14 years 9 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
In this project we consider the problem of tracking a soccer player using a static camera. The main goal is to find the position of players in the field at each instance of time t...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...