37 search results - page 8 / 8 » Bounds On The Labelling Numbers Of Chordal Graphs |
FSTTCS
2009
Springer
14 years 10 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
WWW
2011
ACM
13 years 21 days ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...