Results 251 to 260 of about 2,087,550 (284)
Some of the next articles are maybe not open access.
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.
Alberto Sangiovanni-Vincentelli +2 more
openaire +3 more sources
2004
Publisher Summary The chapter discusses adjacent list models used in databases. The chapter describes a method for showing hierarchies in SQL that consists of a column for the boss and another column for the employee in a relationship. It is a direct implementation in a table of the adjacency list model of a graph.
J. Celko
openaire +3 more sources
Publisher Summary The chapter discusses adjacent list models used in databases. The chapter describes a method for showing hierarchies in SQL that consists of a column for the boss and another column for the employee in a relationship. It is a direct implementation in a table of the adjacency list model of a graph.
J. Celko
openaire +3 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 ...
Yijie Wang, Weidong Zhao, Weihui Dai
openaire +3 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.
W. Bieniecki, Szymon Grabowski
openaire +3 more sources
Relaxation Matching for Chinese Character Recognition Using Adjacency List
2009 International Conference on Management and Service Science, 2009Xi Wang, Xianglin Huang, Zhu-Lin Tao
openaire +3 more sources
A Simple Completely Adjacency List Oriented Relational Extraction Model
International Conference on Cyber Security and Cloud Computing, 2023Entity relationship extraction aims to extract important triplet information from massive unstructured data, which is the basis of downstream tasks such as building a knowledge map.
Jing Liao, Xiande Su, Cheng Peng
semanticscholar +1 more source
Visual Adjacency Lists for Dynamic Graphs
IEEE Transactions on Visualization and Computer Graphics, 2014We present a visual representation for dynamic, weighted graphs based on the concept of adjacency lists. Two orthogonal axes are used: one for all nodes of the displayed graph, the other for the corresponding links. Colors and labels are employed to identify the nodes.
Michael Burch +2 more
openaire +3 more sources
Neural Architecture Search Based on a Multi-Objective Evolutionary Algorithm With Probability Stack
IEEE Transactions on Evolutionary Computation, 2023With the emergence of deep neural networks, many research fields, such as image classification, object detection, speech recognition, natural language processing, machine translation, and automatic driving, have made major breakthroughs in technology and
Yu Xue, Cheng Chen, A. Słowik
semanticscholar +1 more source
Graph Stream Sketch: Summarizing Graph Streams With High Speed and Accuracy
IEEE Transactions on Knowledge and Data Engineering, 2023A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with every item.
Xiangyang Gou +3 more
semanticscholar +1 more source