Results 111 to 120 of about 155 (146)

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. [PDF]

Algorithmica, 2020
Mnich M, Schlotter I.
europepmc   +1 more source

On m-polar fuzzy graph structures. [PDF]

Springerplus, 2016
Akram M, Akmal R, Alshehri N.
europepmc   +1 more source

Overlay networks for wireless ad hoc networks

, 2005
. 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  

Minimum triplet covers of binary phylogenetic X-trees. [PDF]

J Math Biol, 2017
Huber KT, Moulton V, Steel M.
europepmc   +1 more source

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  

List 3-coloring on comb-convex and caterpillar-convex bipartite graphs. [PDF]

J Comb Optim
Şen BB, Erlebach T, Yaşar Ö.
europepmc   +1 more source

The combinatorics of discrete time-trees: theory and open problems. [PDF]

J Math Biol, 2018
Gavryushkin A, Whidden C, Matsen FA.
europepmc   +1 more source

Quantifying the difference between phylogenetic diversity and diversity indices. [PDF]

J Math Biol
Bordewich M, Semple C.
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source