Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14294
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBRIJDER, Robert-
dc.contributor.authorHarju, Tero-
dc.contributor.authorHoogeboom, Hendrik Jan-
dc.date.accessioned2012-11-09T10:35:56Z-
dc.date.available2012-11-09T10:35:56Z-
dc.date.issued2012-
dc.identifier.citationTHEORETICAL COMPUTER SCIENCE, 454, p. 64-71-
dc.identifier.issn0304-3975-
dc.identifier.urihttp://hdl.handle.net/1942/14294-
dc.description.abstractWe consider sequences of local and edge complementations on graphs with loops (we allow local complementation only on looped vertices). We recall that these operations together form the matrix operation of principal pivot transform (or pivot) restricted to graphs. This fact is not well known, and as a consequence various special cases of the properties of pivot have been rediscovered multiple times. In this paper we give a gentle overview of various properties of pivot for local and edge complementations on graphs. Moreover, we relate the pivot operation to perfect matchings to obtain a purely graph-theoretical characterization of the effect of sequences of pivot operations. Finally, we show that two of the three operations that make up a formal graph model of the biological process of gene assembly in ciliates together form the matrix operation of Schur complement restricted to graphs. (C) 2012 Elsevier B.V. All rights reserved.-
dc.language.isoen-
dc.publisherELSEVIER SCIENCE BV-
dc.subject.otherComputer Science, Theory & Methods; principal pivot transform; perfect matchings; gene assembly in ciliates; local complementation; circle graph-
dc.subject.otherPrincipal pivot transform; Perfect matchings; Gene assembly in ciliates; Local complementation; Circle graph-
dc.titlePivots, determinants, and perfect matchings of graphs-
dc.typeJournal Contribution-
dc.identifier.epage71-
dc.identifier.spage64-
dc.identifier.volume454-
local.format.pages8-
local.bibliographicCitation.jcatA1-
dc.description.notes[Brijder, Robert] Hasselt Univ, Dept WET INF, B-3590 Diepenbeek, Belgium. [Brijder, Robert] Transnatl Univ Limburg, Limburg, Belgium. [Harju, Tero] Univ Turku, Dept Math, FI-20014 Turku, Finland. [Hoogeboom, Hendrik Jan] Leiden Univ, Leiden Inst Adv Comp Sci, NL-2300 RA Leiden, Netherlands. robert.brijder@uhasselt.be-
local.publisher.placeAMSTERDAM-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1016/j.tcs.2012.02.031-
dc.identifier.isi000308452100008-
item.accessRightsOpen Access-
item.validationecoom 2013-
item.fulltextWith Fulltext-
item.fullcitationBRIJDER, Robert; Harju, Tero & Hoogeboom, Hendrik Jan (2012) Pivots, determinants, and perfect matchings of graphs. In: THEORETICAL COMPUTER SCIENCE, 454, p. 64-71.-
item.contributorBRIJDER, Robert-
item.contributorHarju, Tero-
item.contributorHoogeboom, Hendrik Jan-
crisitem.journal.issn0304-3975-
crisitem.journal.eissn1879-2294-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Pivots, determinants, and perfect matchings of graphs.pdfPublished version250.69 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

1
checked on Sep 3, 2020

WEB OF SCIENCETM
Citations

1
checked on Apr 22, 2024

Page view(s)

64
checked on Sep 6, 2022

Download(s)

96
checked on Sep 6, 2022

Google ScholarTM

Check

Altmetric


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