메뉴 건너뛰기




Volumn , Issue , 2013, Pages 6126-6131

On strong structural controllability of networked systems: A constrained matching approach

Author keywords

constrained matchings; Network controllability; Network observability; Strong structural controllability

Indexed keywords

CONTROLLABILITY;

EID: 84883522510     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2013.6580798     Document Type: Conference Paper
Times cited : (156)

References (16)
  • 4
    • 0016072062 scopus 로고
    • Structural controllability
    • Aug
    • C.-T. Lin, "Structural Controllability, " IEEE Trans. on Automatic Control, vol. AC-19, no. 3, pp. 201-208, Aug. 1974.
    • (1974) IEEE Trans. on Automatic Control , vol.AC-19 , Issue.3 , pp. 201-208
    • Lin, C.-T.1
  • 6
    • 60349092443 scopus 로고    scopus 로고
    • Controllability of multi-agent systems from a graph-theoretic perspective
    • A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt, "Controllability of multi-agent systems from a graph-theoretic perspective, " SIAM Journal on Control and Optimization, vol. 48, no. 1, pp. 162-186, 2009.
    • (2009) SIAM Journal on Control and Optimization , vol.48 , Issue.1 , pp. 162-186
    • Rahmani, A.1    Ji, M.2    Mesbahi, M.3    Egerstedt, M.4
  • 7
    • 79955879494 scopus 로고    scopus 로고
    • Controllability of complex networks
    • May
    • Y.-Y. Liu, J.-J. Slotine, and A.-L. Barabási, " Controllability of complex networks, " Nature, vol. 473, no. 7346, pp. 167-73, May 2011.
    • (2011) Nature , vol.473 , Issue.7346 , pp. 167-173
    • Liu, Y.-Y.1    Slotine, J.-J.2    Barabási, A.-L.3
  • 13
    • 0142043273 scopus 로고    scopus 로고
    • Uniquely restricted matchings
    • M. Golumbic, T. Hirst, and M. Lewenstein, "Uniquely restricted matchings, " Algorithmica, vol. 31, no. 2, pp. 139-154, 2001.
    • (2001) Algorithmica , vol.31 , Issue.2 , pp. 139-154
    • Golumbic, M.1    Hirst, T.2    Lewenstein, M.3
  • 14
  • 15
    • 11944253901 scopus 로고    scopus 로고
    • Cambridge: Cambridge University Press
    • B. Bollobás, Random Graphs. Cambridge: Cambridge University Press, 2001.
    • (2001) Random Graphs
    • Bollobás, B.1
  • 16
    • 80053057723 scopus 로고    scopus 로고
    • On the maximum uniquely restricted matching for bipartite graphs
    • Aug
    • S. Mishra, "On the Maximum Uniquely Restricted Matching for Bipartite Graphs, " Electronic Notes in Discrete Mathematics, vol. 37, pp. 345-350, Aug. 2011.
    • (2011) Electronic Notes in Discrete Mathematics , vol.37 , pp. 345-350
    • Mishra, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.