Skip to main content Skip to main navigation menu Skip to site footer
Acta Cybernetica
  • Accepted Papers
  • Current
  • Archives
  • Announcements
  • About
    • About the Journal
    • Submissions
    • Editorial Board
    • Contact
Search
  • Register
  • Login
  1. Home /
  2. Archives /
  3. Vol. 13 No. 1 (1997) /
  4. Regular articles

Generalized Harary games

Authors

  • András Pluhár

Downloads

Download data is not yet available.

Downloads

  • PDF

Published

1997-01-01

How to Cite

Pluhár, A. (1997). Generalized Harary games. Acta Cybernetica, 13(1), 77–83. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3481
  • ACM
  • APA
  • Chicago
  • IEEE
  • Turabian
Download Citation
  • Endnote/Zotero/Mendeley (RIS)
  • BibTeX

Issue

Vol. 13 No. 1 (1997)

Section

Regular articles

Most read articles by the same author(s)

  • András Bóta, Miklós Krész, András Pluhár, Dynamic communities and their detection , Acta Cybernetica: Vol. 20 No. 1 (2011)
  • András Bóta, Miklós Krész, András Pluhár, Approximations of the generalized cascade model , Acta Cybernetica: Vol. 21 No. 1 (2013)
  • Geza Makay, Andras Pluhar, Linear Time Ordering of Bins using a Conveyor System , Acta Cybernetica: Vol. 24 No. 2 (2019): Regular papers
  • Erika Griechisch, András Pluhár, Community detection by using the extended modularity , Acta Cybernetica: Vol. 20 No. 1 (2011)
  • András London, András Pluhár, Spanning Tree Game as Prim Would Have Played , Acta Cybernetica: Vol. 23 No. 3 (2018)
  • András Pluhár, The recycled Kaplansky's game , Acta Cybernetica: Vol. 16 No. 3 (2004)
  • András Pluhár, Remarks on the interval number of graphs , Acta Cybernetica: Vol. 12 No. 2 (1995)

Developed By

Open Journal Systems

Information

  • For Readers
  • For Authors
  • For Librarians

Make a Submission

Make a Submission
Most read in last month
  • Approximations to the Normal Probability Distribution Function using Operators of Continuous-valued Logic
    340
  • Optimal strategy in games with chance nodes
    241
  • A tourist guide through treewidth
    216
  • Complexity of right-ideal, prefix-closed, and prefix-free regular languages
    215
  • All minimal clones on the three-element set
    199

Current Issue

  • Atom logo
  • RSS2 logo
  • RSS1 logo
Publisher    
University of Szeged, Institute of Informatics
Publisher's headquarters    
Árpád square 2, H-6720 Szeged, Hungary
Responsible Publisher    
László Nyúl
Editor-in-chief    
Tibor Csendes
Managing editor    
Boglárka G.-Tóth
ISSN    
0324-721X (Print)
ISSN    
2676-993X (Online)
 
 
More information about the publishing system, Platform and Workflow by OJS/PKP.