1154 search results - page 37 / 231 » On the editing distance of graphs |
ITCC
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
LCPC
1991
Springer
14 years 6 days ago
1991
Springer
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
ACSAC
2004
IEEE
14 years 14 days ago
2004
IEEE
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
CMOT
2004
13 years 8 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...