Results 251 to 260 of about 2,137,172 (311)
Some of the next articles are maybe not open access.
Acceleration of Packet Classification Using Adjacency List of Rules
2019 28th International Conference on Computer Communication and Networks (ICCCN), 2019Packet classification is used to determine the behavior of packets incoming to network devices. Since it is achieved using linear search on a classification rule list, a large number of rules leads to longer communication latency. To decrease this latency, the problem is generalized as optimal rule ordering (ORO), which aims to identify the order of ...
Takashi Fuchino +3 more
openaire +2 more sources
Simplify Test Requirement Suite Automatically by Adjacency List
2009 Asia-Pacific Conference on Information Processing, 2009Simplifying test requirement suite is helpful for optimizing test case suite, as is proposed in this paper, it bases on adjacency list. Primarily, confirmed the test requirements and generated the initial test case suite according to program flow diagram, then drew the directed graph of relationships of test requirements and its corresponding adjacency
Jianyuan Su +6 more
openaire +2 more sources
Mining Preferred Browsing Paths Based on Adjacency List Models
2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, 2008Mining preferred browsing paths from Web logs can help improve the structure of Web sites and increase the click-stream. In this paper, an algorithm of mining preferred browsing paths based on adjacency list model is proposed. The Web pages are denoted by vertexes of a directed graph and the topology structure of Web sites is represented by adjacency ...
Weidong Zhao, Weihui Dai, Yijie Wang
openaire +2 more sources
Stack Implementation of Adjacency List for Representation of Graphs
Confluence 2013: The Next Generation Information Technology Summit (4th International Conference), 2013Graph theory has played a vital role in implementation of many mathematical and computer applications [8]. The immensely critical role of graph theory calls for an efficient methodology of representing the graphs. In this paper we explore an approach to represent the graphs [1] through adjacency lists using stacks instead of the conventional methods ...
A. Yadav, R. Jindal, A. Bhat
openaire +2 more sources
The Complexity of Counting Cycles in the Adjacency List Streaming Model
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019We study the problem of counting cycles in the adjacency list streaming model, fully resolving in which settings there exist sublinear space algorithms. Our main upper bound is a two-pass algorithm for estimating triangles that uses $\wtO (m/T^2/3 )$ space, where m is the edge count and T is the triangle count of the graph.
John Kallaugher +3 more
openaire +2 more sources
An edge‐oriented adjacency list for undirected graphs
International Journal of Circuit Theory and Applications, 1979AbstractA new data structure, called the Edge‐Oriented Adjacency List (EOAL), for representing undirected graphs is presented. It provides more information on the edges and requires less storage space than the conventional adjacency list. Furthermore, it is superior to the conventional adjacency list in both insertion and deletion operations.
L. K. Chen +2 more
openaire +2 more sources
Merging Adjacency Lists for Efficient Web Graph Compression
International Conference on Man-Machine Interactions, 2011Analysing Web graphs meets a difficulty in the necessity of storing a major part of huge graphs in the external memory, which prevents efficient random access to edge (hyperlink) lists. A number of algorithms involving compression techniques have thus been presented, to represent Web graphs succinctly but also providing random access.
Szymon Grabowski, Wojciech Bieniecki
openaire +2 more sources
Relaxation Matching for Chinese Character Recognition Using Adjacency List
2009 International Conference on Management and Service Science, 2009Xi Wang, Xianglin Huang, Zhulin Tao
openaire +2 more sources