Výsledky vyhledávání

Obstructions to faster diameter computation: Asteroidal sets

Autor: Ducoffe, Guillaume

An extremity is a vertex such that the removal of its closed neighbourhood does not increase the number of connected components. Let Ext_α be the class of all connected graphs whose quotient graph obtained from modular decomposition contains no more

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b689678d3b9c09c70c97ff17020ebea

Zobrazit plný text záznamu

Akademický článek

Graph Extremities Defined by Search Algorithms

Autor: Jean-Paul Bordat, Geneviève Simonet, Jean R.S. Blair, Anne Berry

Publikováno v: Algorithms, Vol 3, Iss 2, Pp 100-124 (2010)

Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms cal

Externí odkaz: https://doaj.org/article/ac3bf08eb0d7412593075c30758b7f05

Zobrazit plný text záznamu

Akademický článek

Computing a Clique Tree with the Algorithm Maximal Label Search

Autor: Anne Berry, Geneviève Simonet

Publikováno v: Algorithms, Vol 10, Iss 1, p 20 (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 Sea

Externí odkaz: https://doaj.org/article/46d1a6fa362f48d6b7e30a0d7c32f495

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Linear Time LexDFS on Chordal Graphs

Autor: Beisegel, Jesse, Köhler, Ekkehard, Scheffler, Robert, Strehler, Martin

Lexicographic Depth First Search (LexDFS) is a special variant of a Depth First Search (DFS), which was introduced by Corneil and Krueger in 2008. While this search has been used in various applications, in contrast to other graph searches, no genera

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a554b0760a484b019e7d3348806e4a39

Zobrazit plný text záznamu

Medians in median graphs and their cube complexes in linear time

Autor: Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès

Publikováno v: ICALP 2020 47th International Colloquium on Automata, Languages, and Programming
ICALP 2020 47th International Colloquium on Automata, Languages, and Programming, 2020, Saarbrücken, Germany. pp.10:1--10:17, ⟨10.4230/LIPIcs.ICALP.2020.10⟩
Journal of Computer and System Sciences
Journal of Computer and System Sciences, 2022, 126, pp.80-105. ⟨10.1016/j.jcss.2022.01.001⟩

International audience; The median of a set of vertices P of a graph G is the set of all vertices x of G minimizing the sum of distances from $x$ to all vertices of P. In this paper, we present a linear time algorithm to compute medians in median gra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f62723a6f1c620a56703ba551012802

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání