DS-1-4 Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus

スポンサーリンク

概要

• 論文の詳細を見る
• 社団法人電子情報通信学会の論文
• 2010-03-02

著者

• Seto Kazuhisa

  Graduate School Of Informatics Kyoto University

• Tamaki Suguru

  Graduate School Of Informatics Kyoto University

• Iwama Kazuo

  Kyoto Univ. Kyoto

• Iwama Kazuo

  Graduate School Of Informatics Kyoto University

関連論文

• A (2-c(logN)/N)-Approximation Algorithm for the Stable Marriage Problem(Invited Papers from New Horizons in Computing)
• Efficient Methods for Determining DNA Probe Orders(Discrete Mathematics and Its Applications)
• New Graph Calculi for Planar Non-3-Colorable Graphs
• The Planar Hajos Calculus for Bounded Degree Graphs
• DS-1-4 Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus
• General Bounds for Quantum Biased Oracles (特集:量子計算と量子情報)
• Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations(Discrete Mathematics and Its Applications)
• 1-E-2 Online Chasing Problems for Regular n-Gons
• Exponential Speedup by Vector Operations
• Quantum Biased Oracles (特集:量子計算と量子情報)
• A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
• General Bounds for Quantum Biased Oracles
• A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis

もっと見る 閉じる

スポンサーリンク