An Evolutionary Framework for Analyzing the Distance Preserving Property of Weighted Graphs

A subgraph H of a given graph G is isometric if the distances between every pair of vertices in H are the same as the distances of those vertices in G. We say a graph G is distance preserving if there exists an isometric subgraph of every possible order up to the order of G. Distance preserving prop...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) S. 577 - 584
Hauptverfasser:	Zahedi, Emad, Mirmomeni, Masoud, Esfahanian, Abdol-Hossein
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 31.07.2017
Schriftenreihe:	ACM Conferences
Schlagworte:	Computing methodologies Computing methodologies > Artificial intelligence Computing methodologies > Artificial intelligence > Search methodologies Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search Computing methodologies > Artificial intelligence > Search methodologies > Game tree search Computing methodologies > Artificial intelligence > Search methodologies > Heuristic function construction Computing methodologies > Machine learning Computing methodologies > Machine learning > Machine learning approaches Computing methodologies > Machine learning > Machine learning approaches > Bio-inspired approaches Computing methodologies > Machine learning > Machine learning approaches > Bio-inspired approaches > Genetic algorithms Distance preserving evolutionary algorithm isometric subgraphs Mathematics of computing Mathematics of computing > Discrete mathematics Mathematics of computing > Discrete mathematics > Graph theory Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms mutation rate population size selection operator Theory of computation selection operator Distance preserving mutation rate evolutionary algorithm isometric subgraphs population size
ISBN:	1450349935, 9781450349932
ISSN:	2473-991X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!