522 search results - page 23 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
CP
2005
Springer
15 years 8 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
123
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
120
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
119
click to vote
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
123
click to vote
CGF
2008
15 years 2 months ago
2008
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...