1986 search results - page 216 / 398 » Path Separability of Graphs |
118
click to vote
IICS
2003
Springer
15 years 7 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
131
click to vote
HYBRID
2001
Springer
15 years 7 months ago
2001
Springer
Efficient algorithms exist for fault detection and isolation of physical systems based on functional redundancy. In a qualitative approach, this redundancy can be captured by a tem...
116
click to vote
FOCS
1999
IEEE
15 years 6 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...
139
click to vote
SIGSOFT
1994
ACM
15 years 6 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
128
click to vote
JCO
2011
14 years 9 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...