On persistent directed graphs

Jørgen Bang-Jensen, T. Jordán

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open. In this note we show that for directed graphs D with ΣvεV(D) min{δD(V),2} ≤ 2| V (D)

Original languageEnglish
Pages (from-to)271-276
Number of pages6
JournalNetworks
Volume52
Issue number4
DOIs
Publication statusPublished - Dec 2008

Fingerprint

Directed graphs
Autonomous agents
Testing

Keywords

  • Acyclic digraphs
  • Autonomous agent formations
  • Minimally rigid graphs
  • Orientations
  • Persistent digraphs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

On persistent directed graphs. / Bang-Jensen, Jørgen; Jordán, T.

In: Networks, Vol. 52, No. 4, 12.2008, p. 271-276.

Research output: Contribution to journalArticle

Bang-Jensen, J & Jordán, T 2008, 'On persistent directed graphs', Networks, vol. 52, no. 4, pp. 271-276. https://doi.org/10.1002/net.20248
Bang-Jensen, Jørgen ; Jordán, T. / On persistent directed graphs. In: Networks. 2008 ; Vol. 52, No. 4. pp. 271-276.
@article{d30fa6e7ea9f4fbdaa101e5a9476ab78,
title = "On persistent directed graphs",
abstract = "The concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open. In this note we show that for directed graphs D with ΣvεV(D) min{δD(V),2} ≤ 2| V (D)",
keywords = "Acyclic digraphs, Autonomous agent formations, Minimally rigid graphs, Orientations, Persistent digraphs",
author = "J{\o}rgen Bang-Jensen and T. Jord{\'a}n",
year = "2008",
month = "12",
doi = "10.1002/net.20248",
language = "English",
volume = "52",
pages = "271--276",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - On persistent directed graphs

AU - Bang-Jensen, Jørgen

AU - Jordán, T.

PY - 2008/12

Y1 - 2008/12

N2 - The concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open. In this note we show that for directed graphs D with ΣvεV(D) min{δD(V),2} ≤ 2| V (D)

AB - The concept of persistent directed graphs was introduced by Hendrickx et al. to help analyze the stability of autonomous agent systems. They provided a combinatorial characterization for persistence but the complexity of testing persistence remained open. In this note we show that for directed graphs D with ΣvεV(D) min{δD(V),2} ≤ 2| V (D)

KW - Acyclic digraphs

KW - Autonomous agent formations

KW - Minimally rigid graphs

KW - Orientations

KW - Persistent digraphs

UR - http://www.scopus.com/inward/record.url?scp=56749097963&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56749097963&partnerID=8YFLogxK

U2 - 10.1002/net.20248

DO - 10.1002/net.20248

M3 - Article

AN - SCOPUS:56749097963

VL - 52

SP - 271

EP - 276

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -