• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A study on approximation of isomorphism problems

Research Project

Project/Area Number 24800082
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionNational Institute of Informatics

Principal Investigator

YOSHIDA Yuichi  国立情報学研究所, 情報学プリンシプル研究系, 特任助教 (50636967)

Project Period (FY) 2012-08-31 – 2014-03-31
Project Status Completed (Fiscal Year 2013)
Budget Amount *help
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2012: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Keywords同型性判定問題 / 性質検査 / 近似アルゴリズム / 制約充足問題 / 割り当て問題 / 同型性判定 / スペクトル解析 / 国際情報交換(アメリカ合衆国)
Research Abstract

The problems of deciding whether given two objects, such as graphs and functions, are "essentially" the same or not is called the isomorphism problems. The isomorphism problems have been studied intensively, but whether they are tractable in polynomial time remains open. In this project, I considered a variant of the isomorphism problems in which we compute how close two objects are instead of whether they are the same or not. I obtained several new results about this variant under the paradigms called "property testing" and "approximation algorithms".

Report

(3 results)
  • 2013 Annual Research Report   Final Research Report ( PDF )
  • 2012 Annual Research Report
  • Research Products

    (59 results)

All 2014 2013 2012

All Journal Article (38 results) (of which Peer Reviewed: 17 results) Presentation (21 results) (of which Invited: 2 results)

  • [Journal Article] A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems2014

    • Author(s)
      Yuichi Yoshida
    • Journal Title

      Proceedings of the 46th ACM Symposium on the Theory of Computing (STOC)

    • Related Report
      2013 Final Research Report
  • [Journal Article] Dynamic and Historical Shortest-Path Distance Queries on Large Evolving Networks by Pruned Landmark Labeling2014

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Journal Title

      Proc. 23rd International World Wide Web Conference (WWW)

    • Related Report
      2013 Final Research Report
  • [Journal Article] Linear Time FPT Algorithms via Network Flow2014

    • Author(s)
      Yoichi Iwata, Keigo Oka, Yuichi Yoshida
    • Journal Title

      Proc. 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

      Pages: 1749-1761

    • Related Report
      2013 Final Research Report
  • [Journal Article] Parameterized Testability2014

    • Author(s)
      Kazuo Iwama and Yuichi Yoshida
    • Journal Title

      Proc. 5th Innovations in Theoretical Computer Science (ITCS)

      Pages: 507-516

    • Related Report
      2013 Final Research Report
  • [Journal Article] Approximation Schemes via Sherali-Adams Hierarchy for Dense Constraint Satisfaction Problems and Assignment Problems2014

    • Author(s)
      Yuichi Yoshida and Yuan Zhou
    • Journal Title

      Proc. 5th Innovations in Theoretical Computer Science (ITCS)

      Pages: 423-438

    • Related Report
      2013 Final Research Report
  • [Journal Article] A query efficient non-adaptive long code test with perfect completeness2014

    • Author(s)
      Suguru Tamaki, Yuichi Yoshida
    • Journal Title

      Random Structures & Algorithms

    • NAID

      120005676683

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Journal Article] Generalized Skew Bisubmodularity: A Characterization and a Min-Max Theorem2014

    • Author(s)
      Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida
    • Journal Title

      Discrete Optimization

      Volume: 12

    • NAID

      120005411432

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Generalized Skew Bisubmodularity : A Characterization and a Min-Max Theorem2013

    • Author(s)
      Satoru Fujishige, Shin-ichi Tanigawa, Yuichi Yoshida
    • Journal Title

      Discrete Optimization

    • NAID

      120005411432

    • Related Report
      2013 Final Research Report
  • [Journal Article] Property Testing for Cyclic Groups and Beyond. Francois Le Gall2013

    • Author(s)
      Yuichi Yoshida
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 26(4) Pages: 636-654

    • Related Report
      2013 Final Research Report
  • [Journal Article] Testing Supermodular-cut Condition2013

    • Author(s)
      Shin-ichi Tanigawa, Yuichi Yoshida
    • Journal Title

      Algorithmica

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Journal Article] Fast and Scalable Reachability Queries on Graphs by Pruned Labeling with Landmarks and Paths2013

    • Author(s)
      Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Journal Title

      Proc. 22nd ACM International Conference on Information and Knowledge Management (CIKM)

      Pages: 1601-1606

    • Related Report
      2013 Final Research Report
  • [Journal Article] Linear-Time Enumeration of Maximal k-Edge-Connected Subgraphs in Large Networks by Random Contraction2013

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Journal Title

      Proc. 22nd ACM International Conference on Information and Knowledge Management (CIKM)

      Pages: 909-918

    • Related Report
      2013 Final Research Report
  • [Journal Article] Semi-strong coloring of intersecting hypergraphs2013

    • Author(s)
      Eric Blais, Amit Weinstein, Yuichi Yoshida
    • Journal Title

      Combinatorics Probability and Computing

      Pages: 1-7

    • Related Report
      2013 Annual Research Report 2013 Final Research Report
  • [Journal Article] Mining for Analogous Tuples from an Entity-Relation Graph2013

    • Author(s)
      Danushka Bollegala, Mitsuru Kushimoto, Yuichi Yoshida, Ken-ichi Kawarabayashi
    • Journal Title

      Proc. 23rd International Joint Conference on Artificial Intelligence (IJCAI)

    • Related Report
      2013 Final Research Report
  • [Journal Article] An Algebraic Characterization of Testable CSPs2013

    • Author(s)
      Arnab Bhattacharyya, Yuichi Yoshida
    • Journal Title

      Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP)

      Pages: 123-134

    • Related Report
      2013 Final Research Report
  • [Journal Article] Testing Linear-Invariant Function Isomorphism2013

    • Author(s)
      Karl Wimmer, Yuichi Yoshida
    • Journal Title

      Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP)

      Pages: 840-850

    • Related Report
      2013 Final Research Report
  • [Journal Article] Testing Subdivision-Freeness :–Property Testing Meets Structural Graph Theory–2013

    • Author(s)
      Ken-ichi Kawarabayashi and Yuichi Yoshida
    • Journal Title

      Proc. 45th ACM Symposium on Theory of Computing (STOC)

      Pages: 437-446

    • NAID

      110009768651

    • Related Report
      2013 Final Research Report
  • [Journal Article] Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling2013

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Journal Title

      Proc. ACM SIGMOD International Conference on Management of Data (SIGMOD)

      Pages: 349-360

    • Related Report
      2013 Final Research Report
  • [Journal Article] Exact and Approximation Algorithms for the Constraint Satisfaction Problem over the Point Algebra2013

    • Author(s)
      Iwata Yoichi, Yuichi Yoshida
    • Journal Title

      Proc. 30th Symposium on Theoretical Aspects of Computer Science (STACS)

      Pages: 127-138

    • Related Report
      2013 Final Research Report
  • [Journal Article] Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs2013

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
    • Journal Title

      International Journal of Networking and Computing

      Pages: 192-204

    • NAID

      130005475364

    • Related Report
      2013 Final Research Report
  • [Journal Article] Property Testing for Cyclic Groups and Beyond2013

    • Author(s)
      Francois Le Gall, Yuichi Yoshida
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 26(4)

    • Related Report
      2013 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Testing linear-invariant function isomorphism2013

    • Author(s)
      Karl Wimmer and Yuichi Yoshida
    • Journal Title

      Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] An algebraic characterization of testable CSPs2013

    • Author(s)
      Arnab Bhattacharyya and Yuichi Yoshida
    • Journal Title

      Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Fast exact shortest-path distance queries on large networks by pruned landmark labeling2013

    • Author(s)
      Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida
    • Journal Title

      Proc. 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Mining for analogous tuples from an entity-relation graph2013

    • Author(s)
      Danushka Bollegala, Mitsuru Kusumoto, Yuichi Yoshida, and Ken-ichi Kawarabayashi
    • Journal Title

      Proc. 23rd International Joint Conference on Artificial Intelligence (IJCAI)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Testing subdivision-freeness: -- property testing meets structural graph theory --2013

    • Author(s)
      Ken-ichi Kawarabayashi and Yuichi Yoshida
    • Journal Title

      Proc. 45th ACM Symposium on the Theory of Computing (STOC)

      Volume: なし

    • NAID

      110009768651

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Exact and approximation algorithms for the constraint satisfaction problem over the point algebra2013

    • Author(s)
      Yoichi Iwata and Yuichi Yoshida
    • Journal Title

      Proc. 30th Symposium on Theoretical Aspects of Computer Science (STACS)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs2012

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, Hiro Ito
    • Journal Title

      Proc. 3rd International Conference on Networking and Computing (ICNC)

      Volume: (69) Pages: 1-6

    • NAID

      130005475364

    • Related Report
      2013 Final Research Report
  • [Journal Article] Partially Symmetric Functions are Efficiently Isomorphism-Testable2012

    • Author(s)
      Eric Blais, Amit Weinstein, Yuichi Yoshida
    • Journal Title

      Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)

      Pages: 551-560

    • Related Report
      2013 Final Research Report
  • [Journal Article] Constant-time approximation algorithms for the optimum branching problem on sparse graphs2012

    • Author(s)
      Mitsuru Kusumoto, Yuichi Yoshida, and Hiro Ito
    • Journal Title

      Proc. 3rd International Conference on Networking and Computing (ICNC)

      Volume: なし

    • NAID

      130005475364

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Partially symmetric functions are efficiently isomorphism-testable2012

    • Author(s)
      Eric Blais, Amit Weinstein, and Yuichi Yoshida
    • Journal Title

      Proc. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues2012

    • Author(s)
      Suguru Tamaki and Yuichi Yoshida
    • Journal Title

      Proc. 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Constant-time algorithms for sparsity matroids2012

    • Author(s)
      Hiro Ito, Shin-ichi Tanigawa, and Yuichi Yoshida
    • Journal Title

      Proc. 35th International Colloquium on Automata, Language and Programming (ICALP)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Testing list H-homomorphisms2012

    • Author(s)
      Yuichi Yoshida
    • Journal Title

      Proc. 27th Annual IEEE Conference on Computational Complexity (CCC)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Algorithms and complexity of generalized river crossing problems2012

    • Author(s)
      Stefan Langerman Hiro Ito and Yuichi Yoshida
    • Journal Title

      Proc. 6th International Conference on Fun with Algorithms (FUN)

      Volume: なし

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Constant-time approximation algorithms for the knapsack problem2012

    • Author(s)
      Hiro Ito, Susumu Kiyoshima, and Yuichi Yoshida
    • Journal Title

      Proc. 9th Annual Conference on Theory and Applications of Models of Computation (TAMC)

      Volume: なし

    • NAID

      110008689181

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems2012

    • Author(s)
      Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
    • Journal Title

      SIAM J. Comput.

      Volume: 41(4) Issue: 4 Pages: 1074-1093

    • DOI

      10.1137/110828691

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Algorithms for finding a maximum non-k-linked graph2012

    • Author(s)
      Yusuke Kobayashi and Yuichi Yoshida
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 26

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Presentation] Approximation Schemes via Sherali-Adams Hierarchy for Dense Constraint Satisfaction Problems and Assignment Problems2014

    • Author(s)
      Yuichi Yoshida and Yuan Zhou
    • Organizer
      Innovations in Theoretical Computer Science (ITCS)
    • Place of Presentation
      Princeton, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Parameterized Testability2014

    • Author(s)
      Kazuo Iwama and Yuichi Yoshida
    • Organizer
      Innovations in Theoretical Computer Science (ITCS)
    • Place of Presentation
      Princeton, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Linear Time FPT Algorithms via Network Flow.2014

    • Author(s)
      Yoichi Iwata, Keigo Oka, Yuichi Yoshida
    • Organizer
      Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
    • Place of Presentation
      Portland, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Dynamic and Historical Shortest-Path Distance Queries on Large Evolving Networks by Pruned Landmark Labeling2014

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Organizer
      International World Wide Web Conference (WWW)
    • Place of Presentation
      Seoul, South Korea
    • Related Report
      2013 Annual Research Report
  • [Presentation] A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems2014

    • Author(s)
      Yuichi Yoshida
    • Organizer
      ACM Symposium on the Theory of Computing (STOC)
    • Place of Presentation
      New York, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] A Characterization of Locally Testable Affine-Invariant Properties through Decomposition Theorems2013

    • Author(s)
      吉田悠一
    • Organizer
      ELC平成25年度第2回領域会議
    • Related Report
      2013 Final Research Report
  • [Presentation] Testing Subdivision-Freeness : - Property Testing Meets Structural Graph Theory -2013

    • Author(s)
      Yuichi Yoshida
    • Organizer
      コンピュテーション研究会
    • Related Report
      2013 Final Research Report
  • [Presentation] 制約充足問題に対する頑健な近似アルゴリズム2013

    • Author(s)
      Yuichi Yoshida
    • Organizer
      COMP学生シンポジウム
    • Related Report
      2013 Final Research Report
  • [Presentation] Robust approximation of CSPs : Universal algebra meets optimization2013

    • Author(s)
      Yuichi Yoshida
    • Organizer
      ELC Tokyo Complexity Workshop
    • Related Report
      2013 Final Research Report
  • [Presentation] Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling2013

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Organizer
      ACM SIGMOD International Conference on Management of Data (SIGMOD)
    • Place of Presentation
      New York, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Testing Subdivision-Freeness: -- Property Testing Meets Structural Graph Theory --2013

    • Author(s)
      Ken-ichi Kawarabayashi and Yuichi Yoshida
    • Organizer
      ACM Symposium on Theory of Computing (STOC)
    • Place of Presentation
      Palo Alto, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Testing Linear-Invariant Function Isomorphism2013

    • Author(s)
      Karl Wimmer, Yuichi Yoshida
    • Organizer
      International Colloquium on Automata, Languages and Programming (ICALP)
    • Place of Presentation
      Riga, Latvia
    • Related Report
      2013 Annual Research Report
  • [Presentation] An Algebraic Characterization of Testable CSPs2013

    • Author(s)
      Arnab Bhattacharyya, Yuichi Yoshida
    • Organizer
      International Colloquium on Automata, Languages and Programming (ICALP)
    • Place of Presentation
      Riga, Latvia
    • Related Report
      2013 Annual Research Report
  • [Presentation] Mining for Analogous Tuples from an Entity-Relation Graph2013

    • Author(s)
      Danushka Bollegala, Mitsuru Kushimoto, Yuichi Yoshida, Ken-ichi Kawarabayashi
    • Organizer
      International Joint Conference on Artificial Intelligence (IJCAI)
    • Place of Presentation
      Beijing, China
    • Related Report
      2013 Annual Research Report
  • [Presentation] Fast and Scalable Reachability Queries on Graphs by Pruned Labeling with Landmarks and Paths2013

    • Author(s)
      Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Organizer
      ACM International Conference on Information and Knowledge Management (CIKM)
    • Place of Presentation
      San Francisco, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Linear-Time Enumeration of Maximal k-Edge-Connected Subgraphs in Large Networks by Random Contraction2013

    • Author(s)
      Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
    • Organizer
      ACM International Conference on Information and Knowledge Management (CIKM)
    • Place of Presentation
      San Francisco, USA
    • Related Report
      2013 Annual Research Report
  • [Presentation] Robust approximation of CSPs: Universal algebra meets optimization2013

    • Author(s)
      Yuichi Yoshida
    • Organizer
      ELC Tokyo Complexity Workshop
    • Place of Presentation
      品川プリンスホテル
    • Related Report
      2012 Annual Research Report
    • Invited
  • [Presentation] 制約充足問題に対する頑健な近似アルゴリズム2013

    • Author(s)
      Yuichi Yoshida
    • Organizer
      電子情報通信学会2013年総合大会 シンポジウムセッション COMP学生シンポジウム
    • Place of Presentation
      岐阜大学
    • Related Report
      2012 Annual Research Report
    • Invited
  • [Presentation] Partially Symmetric Functions are Efficiently Isomorphism-Testable2012

    • Author(s)
      Yuichi Yoshida
    • Organizer
      コンピュテーション研究会
    • Related Report
      2013 Final Research Report
  • [Presentation] 制約充足問題に対するサブリニアタイムアルゴリズム2012

    • Author(s)
      Yuichi Yoshida
    • Organizer
      第24回RAMPシンポジウム
    • Related Report
      2013 Final Research Report 2012 Annual Research Report
  • [Presentation] Partially Symmetric Functions are Efficiently Isomorphism-Testable2012

    • Author(s)
      Yuichi Yoshida
    • Organizer
      コンピュテーション研究会(COMP)
    • Place of Presentation
      法政大学
    • Related Report
      2012 Annual Research Report

URL: 

Published: 2012-11-27   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi