Listing All st-Orientations

この論文にアクセスする

この論文をさがす

著者

抄録

In this paper we give a simple algorithm to generate all st-orientations of a given biconnected plane graph G with a designated edge (<i>s</i>,<i>t</i>) on the outer face of G. Our algorithm generates all st-orientations of <i>G</i> in <i>O</i>(<i>n</i>) time for each without duplications, where <i>n</i> is the number of vertices.

収録刊行物

  • IEICE transactions on fundamentals of electronics, communications and computer sciences

    IEICE transactions on fundamentals of electronics, communications and computer sciences 94(10), 1965-1970, 2011-10-01

    The Institute of Electronics, Information and Communication Engineers

参考文献:  23件中 1-23件 を表示

キーワード

各種コード

  • NII論文ID(NAID)
    10030191137
  • NII書誌ID(NCID)
    AA10826239
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    09168508
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ