Skip navigation
Skip navigation

Packing vertices and edges in random regular graphs

Request a Copy

link to publisher version

  • Altmetric Citations

Beis, Mihalis; Duckworth, William; Zito, Michele

Description

In this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial up

dc.contributor.authorBeis, Mihalis
dc.contributor.authorDuckworth, William
dc.contributor.authorZito, Michele
dc.date.accessioned2015-12-08T22:19:59Z
dc.identifier.issn1042-9832
dc.identifier.urihttp://hdl.handle.net/1885/31797
dc.description.abstractIn this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial up
dc.publisherJohn Wiley & Sons Inc
dc.sourceRandom Structures and Algorithms
dc.subjectKeywords: Algorithms; Independent sets; Matchings; Random graphs
dc.titlePacking vertices and edges in random regular graphs
dc.typeJournal article
local.description.notesImported from ARIES
local.identifier.citationvolume32
dc.date.issued2008
local.identifier.absfor010303 - Optimisation
local.identifier.ariespublicationu4085724xPUB86
local.type.statusPublished Version
local.contributor.affiliationBeis, Mihalis, University of Liverpool
local.contributor.affiliationDuckworth, William, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliationZito, Michele, University of Liverpool
local.description.embargo2037-12-31
local.bibliographicCitation.issue1
local.bibliographicCitation.startpage20
local.bibliographicCitation.lastpage37
local.identifier.doi10.1002/rsa.20165
dc.date.updated2015-12-08T08:27:09Z
local.identifier.scopusID2-s2.0-38049101391
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Beis_Packing_vertices_and_edges_in_2008.pdf184.62 kBAdobe PDF    Request a copy
Show simple item record


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator