[Yutaro Yamaguchi] Exploring the Limitation of Matroidal Properties in Packing Problems on Graphs

Researcher

Yutaro Yamaguchi

Yutaro Yamaguchi

Osaka University
Graduate School of Information Science and Technology
Assistant Professor

Outline

A packing problem on graphs is to find disjoint structures in a given graph. A variety of packing problems are known to be tractable, where matroidal properties enjoyed by the solution sets play important roles. This study aims to explore the boundary of such matroidal frameworks, and to provide a characterization of tractable packing problems in terms of matroidal properties.

Quick Access

Program

  • CREST
  • PRESTO
  • ACT-I
  • ERATO
  • ACT-C
  • ACCEL
  • ALCA
  • RISTEX
Finish programs
  • Pamphlet
  • ProjectDB
  • GlobalActivity
  • Diversity-EN
  • OS_Policy-EN
  • Question-E