Results 61 to 70 of about 89 (87)

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

, 1996
This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any n-vertex graph G of genus g can be divided in O(n + g) time into components whose ...
L. Aleksandrov, H. Djidjev
core  

On the quality of spectral separators

, 1998
. Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much prior analysis of the quality of the separators produced by this technique;
Gary, L. Miller, Stephen Guattery
core  

Finding All Maximal Cliques of a Family of Induced Subgraphs

, 2008
Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects ...
Daniel Baum
core  

Novel procedures for graph edge-colouring

, 2018
Orientador: Dr. Renato CarmoCoorientador: Dr. André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática.
Zatesko, Leandro Miranda, 1988-
core  

The Page Number Problem for Partially Ordered Sets

, 2013
Umieszczenie grafu w książce jest definiowane przez kolejność jego wierzchołków na grzbiecie książki i przyporządkowanie jego krawędzi stronom książki tak, aby na żadnej stronie krawędzie nie przecinały się. Umieszczenie zbioru częściowo uporządkowanego (
Kwiatkowska, Anna Beata
core  

Spanning Star Trees In Regular Graphs

For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G,
Jerrold W. Grossman
core  

Hamiltonian cycles and travelling salesfolk

, 2023
Alberto Gomez Gomez
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Enumeration of Spanning Trees in a Chain of Diphenylene Graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Hanan Ahmed, Murat Cancan, Mehdi Alaeiyan   +2 more
exaly  

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps

Mathematics of Operations Research, 2022
David P. Williamson, Samuel C. Gutekunst
exaly  

A New Dynamic Programming Approach for Spanning Trees With Chain Constraints and Beyond

Mathematics of Operations Research, 2023
Rico Zenklusen, Martin Nägele
exaly