About: HSAGA and its application for the construction of near-Moore digraphs     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Článek popisuje %22Hybrid Simulated Annealing and Genetic Algorithm%22 (HSAGA), použitelný ke konstrukci velkých orientovaných grafů blízkých Mooreově mezi. (cs)
  • The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and given diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimal solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct large digraphs. We present our new results obtained by HSAGA, as well as several related open problems.
  • The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and given diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimal solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct large digraphs. We present our new results obtained by HSAGA, as well as several related open problems. (en)
Title
  • HSAGA and its application for the construction of near-Moore digraphs
  • HSAGA and its application for the construction of near-Moore digraphs (en)
  • HSAGA a its application for the construction of near-Moore digraphs (cs)
skos:prefLabel
  • HSAGA and its application for the construction of near-Moore digraphs
  • HSAGA and its application for the construction of near-Moore digraphs (en)
  • HSAGA a its application for the construction of near-Moore digraphs (cs)
skos:notation
  • RIV/49777513:23520/08:00501444!RIV09-MSM-23520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...iv/cisloPeriodika
  • 1
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 370836
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/08:00501444
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Moore digraph; Moore bound; simulated annealing; genetic algorithm (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [BBE58A0F432A]
http://linked.open...i/riv/nazevZdroje
  • Journal of Discrete Algorithms
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 6
http://linked.open...iv/tvurceVysledku
  • Miller, Mirka
  • Lin, Yuqing
  • Tang, Jianmin
issn
  • 1570-8667
number of pages
http://localhost/t...ganizacniJednotka
  • 23520
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software