3396 search results - page 122 / 680 » Tree representations of graphs |
CIKM
2003
Springer
14 years 2 months ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
DMTCS
2010
13 years 6 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
NETWORKS
2006
13 years 9 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...