522 search results - page 33 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
106
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
117
click to vote
PAKDD
2009
ACM
16 years 4 days ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
117
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
122
click to vote
BIOINFORMATICS
2007
15 years 3 months ago
2007
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
123
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...