1545 search results - page 288 / 309 » On tree congestion of graphs |
UAI
1996
14 years 11 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
NRHM
2008
14 years 9 months ago
2008
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
ADHOC
2005
14 years 9 months ago
2005
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
CN
2004
14 years 9 months ago
2004
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
IJFCS
1998
14 years 9 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...