1986 search results - page 12 / 398 » Path Separability of Graphs |
82
Voted
ICCSA
2005
Springer
15 years 5 months ago
2005
Springer
Data protection is an increasingly important issue in today’s communication networks. Traditional solutions for protecting data when transferred over a network are almost exclusi...
SCAM
2007
IEEE
15 years 6 months ago
2007
IEEE
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
VR
1993
IEEE
15 years 3 months ago
1993
IEEE
Existing network management systems typically use a combination of textual displays and 2D directed graph representations of network topology. We are designing a network managemen...
94
Voted
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...
DM
2008
14 years 11 months ago
2008
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...