Results 1 - 10 of 19,263

TABLE I AS RELATIONSHIP INFERENCE RESULT Number of links AS graph

in What Causal Forces Shape Internet Connectivity at the AS-level?
by Hyunseok Chang, Sugih Jamin, Walter Willinger 2003
Cited by 3

Table 5.5. Additional Axioms for Link Graph Structural Congruence

in BiLog: Spatial Logics for Bigraphs 1
by Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone

Table 5.5. Additional Axioms for Link Graph Structural Congruence

in BiLog: Spatial Logics for Bigraphs
by Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone

Table 4.4. Additional Axioms for Link Graph Structural Congruence

in Static BiLog: a Unifying Language for Spatial Structures
by Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone

Table 5.5. Additional Axioms for Link Graph Structural Congruence Link Axioms:

in BiLog: Spatial Logics for Bigraphs
by Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone

Table 8.4: Most referenced Web sites, by number of in-links in the graph of Web site links.

in Chapter 8 Characterization of the Chilean Web
by unknown authors

Table 3. Intrinsic linking of 1-deficient graphs.

in unknown title
by unknown authors 2007
"... In PAGE 7: ... For example, no matter which edge we remove from K3,2,2, we will obtain a graph that is not intrinsically linked. Proof: Let us demonstrate that the graphs labeled linked in Table3 are in fact in-... ..."

Table 5. Intrinsic linking of 2-deficient graphs

in unknown title
by unknown authors 2007

Table 4. Encoding Propositional SGL in LGL over two ported ground link graphs

in Spatial Logics for Bigraphs
by Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone 2005
"... In PAGE 10: ... The resulting link graphs can be interpreted as contextual edge labelled graphs and the resulting class of ground link graphs is isomorphic to the graph model of SGL. In Table4 we encode the graphs modelling SGL into ground link graphs and SGL formulae into LGL formulae. The encoding is parametric on a finite set X of names containing the free names of the graph under consideration.... ..."
Cited by 14

Table 2: Histogram of prepass component sizes, in links, for three graphs.

in Automatic IP Address Assignment on Network Topologies
by Jonathon Duerig, et al.
"... In PAGE 11: ... For this part of the study, we chose a representa- tive topology from each of the three topology sets (GT-ITM, BRITE, Rocketfuel); we chose those with the most simi- lar link counts. Table2 shows a histogram of the sizes of the components into which the prepass divides these input topologies. The smaller the largest component, the better the running time of the quadratic algorithms.... ..."
Results 1 - 10 of 19,263