Results 11 to 20 of about 2,126 (197)
Computing a Clique Tree with the Algorithm Maximal Label Search [PDF]
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +4 more sources
The distance energy of clique trees [PDF]
Linear Algebra and its Applications, 2021 10 pages, 1 ...
Jin, Ya-Lei, Gu, Rui, Zhang, Xiao-Dong
openaire +2 more sources
Chordal graphs through clique trees
Cadernos do IME - Série Informática, 2022 Here we present a part of the work in collaboration with Jayme Luiz Szwarcfiter and Marisa Gutierrez, during the development of the thesis of Silvia Tondato at Facultad de Ciencias Exactas (UNLP), "Grafos Cordales: árboles cliques y representaciones canónicas'', finished in 2009.
Marisa Gutierrez, Silvia Tondato
openaire +1 more source
The Distance Laplacian Spectral Radius of Clique Trees [PDF]
Discrete Dynamics in Nature and Society, 2020 The distance Laplacian matrix of a connected graph G is defined as ℒ G
Xiaoling Zhang, Jiajia Zhou
openaire +3 more sources
Shrub-depth: Capturing Height of Dense Graphs [PDF]
Logical Methods in Computer Science, 2019 The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: is there an analogously useful "depth" notion also for dense graphs (say; one which is stable ...
Robert Ganian +4 more
doaj +1 more source
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
Logical properties of random graphs from small addable classes [PDF]
Logical Methods in Computer Science, 2019 We establish zero-one laws and convergence laws for monadic second-order logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes.
Anuj Dawar, Eryk Kopczyński
doaj +1 more source
A simple and space efficient segment tree implementation
MethodsX, 2019 The segment tree is an extremely versatile data structure. In this paper, a new array based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can be removed ...
Lei Wang, Xiaodong Wang
doaj +1 more source
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph
Discussiones Mathematicae Graph Theory, 2021 Let G be a 4-connected graph. We call an edge e of G removable if the following sequence of operations results in a 4-connected graph: delete e from G; if there are vertices with degree 3 in G− e, then for each (of the at most two) such vertex x, delete ...
Wu Jichang +3 more
doaj +1 more source
On-the-Fly Output Compression for Join-Based Graph Mining Algorithms
IEEE Access, 2018 Many join-based graph mining (JGM) algorithms, such as triangle listing and clique enumeration, typically output data of such a large size that it often dominates the mining cost.
Mostofa Kamal Rasel, Young-Koo Lee
doaj +1 more source