1736 search results - page 75 / 348 » The rank-width of Directed Graphs |
187
click to vote
ECCC
2007
15 years 3 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
127
click to vote
EDBT
2008
ACM
15 years 5 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
157
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
135
click to vote
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
147
click to vote
COMBINATORICS
2000
15 years 3 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...