Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.

Bibliographic Details
Main Authors: McDiarmid, C, Reed, B
Format: Journal article
Language:English
Published: 2001
_version_ 1826284247255613440
author McDiarmid, C
Reed, B
author_facet McDiarmid, C
Reed, B
author_sort McDiarmid, C
collection OXFORD
description
first_indexed 2024-03-07T01:11:00Z
format Journal article
id oxford-uuid:8d02adcb-af0c-41ae-ba2b-0f7346e064b0
institution University of Oxford
language English
last_indexed 2024-03-07T01:11:00Z
publishDate 2001
record_format dspace
spelling oxford-uuid:8d02adcb-af0c-41ae-ba2b-0f7346e064b02022-03-26T22:48:26ZChannel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.Journal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:8d02adcb-af0c-41ae-ba2b-0f7346e064b0EnglishSymplectic Elements at Oxford2001McDiarmid, CReed, B
spellingShingle McDiarmid, C
Reed, B
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title_full Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title_fullStr Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title_full_unstemmed Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title_short Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
title_sort channel assignment on nearly bipartite and bounded treewidth graphs
work_keys_str_mv AT mcdiarmidc channelassignmentonnearlybipartiteandboundedtreewidthgraphs
AT reedb channelassignmentonnearlybipartiteandboundedtreewidthgraphs