### Table 1: The performance and log-space overheads of Jockey. Run times are in seconds. Native is the run-time without

2005

Cited by 12

### Table 5: The number hn,m of labelled non-planar projective-planar 2-connected K3,3-free homeomorphically irreducible graphs (having n vertices and m edges).

2007

### Table 1: The performance and log-space overheads of Jockey. Run times are in seconds. Native is the run-time without Jockey. Record and Replay show the runtime during recording and re- playing, respectively.

### Table 1. Summary of the complexity results (GI means graph isomorphism).

"... In PAGE 13: ... 4. Conclusions The main results of this paper are on the one hand the graph isomorphism com- pleteness of the general (combinatorial) polytope isomorphism problem and, on the other hand, the fact that this problem can be solved in polynomial time if the dimensions of the polytopes are bounded by a constant (see Table1 for an overview of the complexity results and Fig. 6 for a sketch of the complexity theoretic land- scape considered in this paper).... In PAGE 14: ... It may be that one can turn our algorithm into a computer code that becomes compatible with nauty for checking combinatorial polytope isomorphism. The remaining two open entries in Table1 concern the complexity of the graph isomorphism problem restricted to graphs of arbitrary (or simplicial) polytopes of bounded dimensions. A polynomial time algorithm for this problem would perhaps not be as interesting as the potential result that the problem is graph isomorphism complete, because the latter result would show that the class of graphs of polytopes... ..."

Cited by 4

### Table 1. Summary of the complexity results (GI means graph isomorphism).

"... In PAGE 13: ... 4. Conclusions The main results of this paper are on the one hand the graph isomorphism com- pleteness of the general (combinatorial) polytope isomorphism problem and, on the other hand, the fact that this problem can be solved in polynomial time if the dimensions of the polytopes are bounded by a constant (see Table1 for an overview of the complexity results and Fig. 6 for a sketch of the complexity theoretic land- scape considered in this paper).... In PAGE 14: ... It may be that one can turn our algorithm into a computer code that becomes compatible with nauty for checking combinatorial polytope isomorphism. The remaining two open entries in Table1 concern the complexity of the graph isomorphism problem restricted to graphs of arbitrary (or simplicial) polytopes of bounded dimensions. A polynomial time algorithm for this problem would perhaps not be as interesting as the potential result that the problem is graph isomorphism complete, because the latter result would show that the class of graphs of polytopes... ..."

Cited by 4

### Table 1. Summary of the complexity results (GI means graph isomorphism).

"... In PAGE 13: ... 4. Conclusions The main results of this paper are on the one hand the graph isomorphism com- pleteness of the general (combinatorial) polytope isomorphism problem and, on the other hand, the fact that this problem can be solved in polynomial time if the dimensions of the polytopes are bounded by a constant (see Table1 for an overview of the complexity results and Fig. 6 for a sketch of the complexity theoretic land- scape considered in this paper).... In PAGE 14: ... It may be that one can turn our algorithm into a computer code that becomes compatible with nauty for checking combinatorial polytope isomorphism. The remaining two open entries in Table1 concern the complexity of the graph isomorphism problem restricted to graphs of arbitrary (or simplicial) polytopes of bounded dimensions. A polynomial time algorithm for this problem would perhaps not be as interesting as the potential result that the problem is graph isomorphism complete, because the latter result would show that the class of graphs of polytopes... ..."

Cited by 4

### Table 1: Definitions of additional symbols used in the graph isomorphism algorithm

1996

Cited by 39

### Table 1: Definitions of additional symbols used in the graph isomorphism algorithm

1996

Cited by 39

### Table 3 Results of e-isomorphism tests on random weighted graphs

2004

"... In PAGE 20: ...ection 4.1.2. The NGI algorithm using ERE and HCN returned a correct solution on all 8000 trials. Table3 shows the average computational times in ms required by both methods for testing on e-isomorphism. In average the HCN implementation is about 1:5 times faster than the ERE implementation.... ..."