1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
<?xml version="1.0" encoding="UTF-8"?>
<!--
Integrity.xml
=========================================================================
This file is part of the GrInvIn project - http://www.grinvin.org
Copyright (C) 2005-2008 Universiteit Gent
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or (at
your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
A copy of the GNU General Public License can be found in the file
LICENSE.txt provided with the source distribution of this program (see
the META-INF directory in the source jar). This license can also be
found on the GNU website at http://www.gnu.org/licenses/gpl.html.
If you did not receive a copy of the GNU General Public License along
with this program, contact the lead developer, or write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
-->
<!DOCTYPE invariant
PUBLIC "-//GrInvIn//Invariant 1.0//EN" "../dtds/invariant.dtd"
>
<invariant>
<id>org.grinvin.invariants.Integrity</id>
<type>integer</type>
<resources>
<properties>
<entry key="name">Integrity</entry>
<help>
<p>The integrity of a graph <latex value="G=(V,E)" /> is defined as
<latex value="I(G)=\mathrm{min}_{S\subset V}\lacc |S| + m(G-S)\racc"/>.
In this formula <latex value="m(G-S)"/> denotes the order of the
largest <link value="org.grinvin.graphtheory.def.connected">component</link>
of <latex value="G-S"/>.</p>
<p>The integrity of a graph is a measure for network reliability that is
less sensitive to local weaknesses than <link value="org.grinvin.invariants.VertexConnectivity">
vertex connectivity</link>.</p>
</help>
</properties>
<node name="nl">
<properties>
<entry key="name">Integriteit</entry>
<help>
<p>De integriteit van een graaf <latex value="G=(V,E)" /> is gedefinieerd als
<latex value="I(G)=\mathrm{min}_{S\subset V}\lacc |S| + m(G-S)\racc"/>.
In deze formule is <latex value="m(G-S)"/> de orde van de grootste
<link value="org.grinvin.graphtheory.def.connected">component</link>
van <latex value="G-S"/>.</p>
<p>De integriteit van een graaf is een maat voor de netwerkbetrouwbaarheid die
minder gevoelig is voor lokale zwakheden dan de <link value="org.grinvin.invariants.VertexConnectivity">
top-connectiviteit</link>.</p>
</help>
</properties>
</node>
</resources>
</invariant>
|
