[图书][B] Topological structure and analysis of interconnection networks

J Xu - 2013 - books.google.com
The advent of very large scale integrated circuit technology has enabled the construction of
very complex and large interconnection networks. By most accounts, the next generation of …

[HTML][HTML] Independent domination in graphs: A survey and recent results

W Goddard, MA Henning - Discrete Mathematics, 2013 - Elsevier
Independent domination in graphs: A survey and recent results - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

A hybrid multi-criteria decision making method approach for selecting a sustainable location of healthcare waste disposal facility

A Chauhan, A Singh - Journal of Cleaner Production, 2016 - Elsevier
Sustainability is the concern of organisations across the world; it has received attention of
researchers from different fields including operations management. For addressing …

[图书][B] Rainbow connections of graphs

X Li, Y Sun - 2012 - books.google.com
Rainbow connections are natural combinatorial measures that are used in applications to
secure the transfer of classified information between agencies in communication networks …

Rainbow connections of graphs: A survey

X Li, Y Shi, Y Sun - Graphs and combinatorics, 2013 - Springer
The concept of rainbow connection was introduced by Chartrand et al.[14] in 2008. It is
interesting and recently quite a lot papers have been published about it. In this survey we …

Average consensus on networks with quantized communication

P Frasca, R Carli, F Fagnani… - International Journal of …, 2009 - Wiley Online Library
This work presents a contribution to the solution of the average agreement problem on a
network with quantized links. Starting from the well‐known linear diffusion algorithm, we …

[HTML][HTML] Structure connectivity and substructure connectivity of hypercubes

CK Lin, L Zhang, J Fan, D Wang - Theoretical Computer Science, 2016 - Elsevier
The connectivity of a network–the minimum number of nodes whose removal will disconnect
the network–is directly related to its reliability and fault tolerability, hence an important …

Genetic algorithm difficulty and the modality of fitness landscapes

J Horn, DE Goldberg - Foundations of genetic algorithms, 1995 - Elsevier
We assume that the modality (ie, number of local optima) of a fitness landscape is related to
the difficulty of finding the best point on that landscape by evolutionary computation (eg …

Hypercube supercomputers

JP Hayes, T Mudge - Proceedings of the IEEE, 1989 - ieeexplore.ieee.org
The architecture and applications of the class of highly parallel distributed-memory
multiprocessors based on the hypercube interconnection structure are surveyed. The history …

[图书][B] Perfect dominating sets

M Livingston, QF Stout - 1990 - Citeseer
A dominating set S of a graph G is perfect if each vertex of G is dominated by exactly one
vertex in S. We study the existence and construction of PDSs in families of graphs arising …