On-line and off-line vertex enumeration by adjacency lists
Operations Research Letters, 1991We propose a new algorithm to solve the on-line vertex enumeration problem for polytopes, doing all computations in n-space, where n is the dimension of the polytope. This algorithm exploits adjacency lists between vertices and uses no simplex tableaux. It can handle the cases of empty or degenerate polyhedra.
Brigitte Jaumard+2 more
openaire +1 more source
An annotated list of the coccinellidae (coleoptera) of Israel and adjacent areas
Phytoparasitica, 1995Seventy-one species of Coccinellidae, their commonness and distribution in Israel and adjacent areas, are listed; 19 of the species are recorded here for the first time. Species expected to occur in Israel but not found in the present studies, probable misidentifications, and introduced species are listed separately.
J. Halperin, O. Merkl, M. Kehat
openaire +2 more sources
An annotated check-list of the echinoderms of the norwegian coast and adjacent waters [PDF]
Abstract This check-list is a compilation of the echinoderms recorded from Norway and the abyssal depths of the Norwegian Sea. Echinoderms not recorded from the Norwegian fauna but found on the North Sea plateau, the British North Sea coast, the Swedish west coast and in Danish waters are also included. Distributional data are provided for each species.
openaire +1 more source
Agglomerative community detection on signed networks based on community adjacency list
Modern Physics Letters B, 2020With the development of data processing technology, complex network theory has been widely applied in many areas. Meanwhile, as one of the essential parts of network science, community detection is becoming more and more important for analyzing and visualizing the real world.
Hui-Dong Wu+3 more
openaire +2 more sources
A note on list edge and list total coloring of planar graphs without adjacent short cycles
Acta Mathematica Sinica, English Series, 2013Let G be a planar graph with maximum degree Δ. In this paper, we prove that if any 4-cycle is not adjacent to an i-cycle for any i ∈ {3, 4} in G, then the list edge chromatic number x l ′ (G) = Δ and the list total chromatic number x l ″ (G) = Δ+1.
Jianliang Wu, Hui Juan Wang
openaire +2 more sources
Structured Construction of VLSI Circuits Using Adjacency Lists
The Fifth International Conference on VLSI Design, 2005There are many algorithms to generate incremental VLSI compaction spacing constraints. This paper will utilize adjacency list representation to structurally construct the VLSI circuits. Algorithms for creation, insertion, deletion and movement of a tile in a double-linked list are given in a pseudo-language.
openaire +2 more sources
Analysis of adjacency effects for Copernicus Ocean Colour Missions
, 2018............................................................................................................................ 4 1. Introduction .......................................................................................................
B. Barbara, Zibordi Giuseppe
semanticscholar +1 more source
Check-List of the Mosses Known to Occur in Southeastern Washington and Adjacent Idaho
The Bryologist, 1928The area covered in this list is that of the Flora of Southeastern Washington and Adjacent Idaho by Chas. V. Piper and R. Kent Beattie, 1914, covering "Spokane, Whitman, Asotin, Garfield, Columbia, and part of Walla Walla counties, Washington, and the western portions of Kootenai, Latah, and Nez Perces counties, Idaho." The moss flora of southeastern ...
G. N. Jones, F. L. Pickett
openaire +2 more sources
A note on finding compact sets in graphs represented by an adjacency list
Information Processing Letters, 1996Abstract Dekel, Hu and Ouyang presented an O(N2) time algorithm for finding all compact sets of an edge-weighted graph G with M edges and N vertices. This is optimal provided G is represented by an adjacency matrix. Assuming G is represented by an adjacency list, we present an improved implementation of their algorithm which takes O(M + N log N) time
openaire +1 more source
Creating a Schedule for Parallel Execution of Tasks Based on the Adjacency Lists
2018The article presents a method for transforming algorithm’s information graph using adjacency lists. Algorithm’s information graph always has a large number of vertices. For most algorithms, this graph contains more than 100 vertices. Manual analysis of this graph for the presence of internal parallelism is very difficult.
Yulia A. Shichkina, M. S. Kupriyanov
openaire +2 more sources