Elementary Loops Revisited
Authors: Jianmin Ji, Hai Wan, Peng Xiao, Ziwei Huo, Zhanhao Xiao
AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | The experiments show that, for certain programs whose dependency graphs consisting of sets of components that are densely connected inside and sparsely connected outside, the new algorithm is more efficient. Table 1 contains the numbers and running times of elementary loops and proper loops for these HC programs. |
| Researcher Affiliation | Academia | a School of Computer Science and Technology, University of Science and Technology of China, Hefei, China jianmin@ustc.edu.cn b School of Software, Sun Yat-sen University, Guangzhou, China wanhai@mail.sysu.edu.cn c School of Information Science and Technology, Sun Yat-sen University, Guangzhou, China |
| Pseudocode | Yes | Algorithm 1 Elementary Loop(L, P); Algorithm 2 Proper Loop(L, P, S); Algorithm 3 Proper Loops(P, S); Algorithm 4 Minimal Separator(P, L); Algorithm 5 Proper Loops (P, L) |
| Open Source Code | No | The information provided does not contain an explicit statement or link for the open-source code of the methodology described in this paper. It mentions a website for 'more information' but not explicitly for code. |
| Open Datasets | No | For Hamiltonian Circuit (HC) problem (Niemel a 1999), we consider graphs that represent networks consisting of sets of components which are densely connected inside but have only a few connections among them... For each M-N-K entry in the table, we randomly created 20 different such graphs... The graphs were created, not obtained from a public dataset with a link or citation for access. |
| Dataset Splits | No | The paper does not provide specific details on training, validation, or test dataset splits. The experiments are conducted on randomly created graphs, but no explicit data partitioning information is given. |
| Hardware Specification | Yes | Our experiments were done on an AMD A10-5800K (3.8GHz) CPU and 3.3GB RAM. |
| Software Dependencies | No | The paper mentions 'Linux /usr/bin/time command' but does not specify any programming languages, libraries, or other software dependencies with version numbers required to replicate the experiments. |
| Experiment Setup | Yes | Specifically, we consider graphs of the form M-N-K: a graph with M copies of the complete graph with N nodes, C1, . . ., CM, and with K arcs from Ci to Ci+1, for each 1 i M (CM+1 is defined to be C1). For each M-N-K entry in the table, we randomly created 20 different such graphs... |