Results 101 to 110 of about 137 (126)
Finding All Maximal Cliques of a Family of Induced Subgraphs
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
Overlay networks for wireless ad hoc networks
. Radio networks are widely used today. People access voice and data services via mobile phones, Bluetooth technology replaces unhandy cables by wireless links, and wireless networking is possible via IEEE 802.11 compatible network equipment.
Christian Scheideler
core
Novel procedures for graph edge-colouring
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 construction of simplicial groups in digital images [PDF]
Bildik N. +5 more
core +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
[2020]Primary 05C25, 37B99; Secondary 05C12, 68R10
This paper introduces a hierarchy of contractive endomorphisms on graphs, providing a rigorous framework for quantitative structural compression. We first define a general class of (m,n)-contractive endomorphisms, which map paths of length m to walks of length at most n, and prove that they form a semigroup under composition. To analyze the dynamics ofzeinab Shahini, Madjid Eshaghi Gordji
openaire +1 more source
Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
Mathematics of Operations Research, 2023Karthekeyan Chandrasekaran +1 more
exaly
Parametric Shortest-Path Algorithms via Tropical Geometry
Mathematics of Operations Research, 2022Michael Joswig +1 more
exaly
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
Mathematics of Operations Research, 2022Karthekeyan Chandrasekaran
exaly

