{"work":{"id":"ef065a6b-cb78-43d8-918a-09a76ea6823b","openalex_id":null,"doi":null,"arxiv_id":"1406.2741","raw_key":null,"title":"A practical heuristic for finding graph minors","authors":null,"authors_text":"Cai, J","year":2014,"venue":"quant-ph","abstract":"We present a heuristic algorithm for finding a graph $H$ as a minor of a graph $G$ that is practical for sparse $G$ and $H$ with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer.","external_url":"https://arxiv.org/abs/1406.2741","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-05-21T12:20:06.840213+00:00","pith_arxiv_id":"1406.2741","created_at":"2026-05-11T08:26:00.779806+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":true,"display_title":"A practical heuristic for finding graph minors","render_title":"A practical heuristic for finding graph minors"},"hub":{"state":{"work_id":"ef065a6b-cb78-43d8-918a-09a76ea6823b","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":11,"external_cited_by_count":null,"distinct_field_count":4,"first_pith_cited_at":"2025-08-14T14:00:30+00:00","last_pith_cited_at":"2026-05-19T05:28:10+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-28T03:36:50.018157+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"method","n":2},{"context_role":"background","n":1}],"polarity_counts":[{"context_polarity":"use_method","n":2},{"context_polarity":"background","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}