✦ LIBER ✦

Graph Decomposition for Memoryless Periodic Exploration

✍ Scribed by Adrian Kosowski; Alfredo Navarra

Book ID: 106149205
Publisher: Springer
Year: 2011
Tongue: English
Weight: 497 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9518-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast periodic graph exploration with con

Fast periodic graph exploration with constant memory

✍ Leszek Gąsieniec; Ralf Klasing; Russell Martin; Alfredo Navarra; Xiaohui Zhang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Pole assignment for linear time-invarian

Pole assignment for linear time-invariant systems by periodic memoryless output feedback

✍ Dirk Aeyels; Jacques L. Willems 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 741 KB

It is shown that under mild conditions stabilization and pole assignment for linear time invariant discrete-time systems are possible by means of periodic memoryless output feedback control.

Graph decompositions for demographic loo

Graph decompositions for demographic loop analysis

✍ Michael J. Adams 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 190 KB

A decomposition for strongly perfect gra

A decomposition for strongly perfect graphs

✍ Stephan Olariu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 554 KB

A graph G is strongly perfect if every induced subgraph H of G contains a stable set that meets all the maximal cliques of H . We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G = (V, €1 is a partition of V into nonempty disjoint su

A graph-theoretical model for periodic d

A graph-theoretical model for periodic discrete structures

✍ James Turner 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Perturbation bounds for the periodic Sch

Perturbation bounds for the periodic Schur decomposition

✍ Xiao Shan Chen 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 460 KB