The computational complexity of three graph problems for instances with bounded minors of constraint matrices

We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value.

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 227; s. 13 - 20
Hlavní autoři: Gribanov, D.V., Malyshev, D.S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 20.08.2017
Elsevier BV
Témata:
Boolean algebra
Boolean linear programming
Combinatorics
Dominating set problem
Efficient algorithm
Formulations
Graphs
Independent set problem
Linear programming
Mathematical analysis
Matrix
Matrix methods
Matrix minor
Dominating set problem
Boolean linear programming
Independent set problem
Matrix minor
Efficient algorithm
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value.
AbstractList We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value.
Author Gribanov, D.V.
Malyshev, D.S.
Author_xml – sequence: 1
  givenname: D.V.
  surname: Gribanov
  fullname: Gribanov, D.V.
  email: dimitry.gribanov@gmail.com
  organization: Lobachevsky State University, 23 Gagarina av., Nizhny Novgorod, 603950, Russia
– sequence: 2
  givenname: D.S.
  orcidid: 0000-0001-7529-8233
  surname: Malyshev
  fullname: Malyshev, D.S.
  email: dsmalyshev@rambler.ru, dmalishev@hse.ru
  organization: National Research University Higher School of Economics, 25/12 Bolshaja Pecherskaja Ulitsa, Nizhny Novgorod, 603155, Russia
BookMark eNp9kE1LAzEQhoMo2FZ_gLeA510n2e5mF09S_IKClwreQjaZtSndTU2yav-9qfXsaXjheYeZZ0pOBzcgIVcMcgasutnkRvU5ByZymOfAyxMyYbXgWSUEOyWTxFQZZ_XbOZmGsAEAltKE9Ks1Uu363RhVtG5Q29-0xW8b99R1NK49In33aremO-_aLfaBds5TO4SoBo2Bftm4pq0bB4OG9nZwPhya2iXCKztE2qvobUIvyFmntgEv_-aMvD7crxZP2fLl8Xlxt8w0FyJmXS20EfOiqFAwbAAV1KXhrdAVqKps52g0lmWhoal4w5XBwkDLG8Y6rBlTxYxcH_emiz9GDFFu3OjTc0GypuBQg2h4otiR0t6F4LGTO2975feSgTxYlRuZrMqDVQlzmaymzu2xg-n8T4teBm0xaTDWo47SOPtP-wf4moOt
Cites_doi 10.1016/j.disopt.2008.12.002
10.1016/S0166-218X(02)00198-1
10.1007/s004930050056
10.1134/S1990478911010029
10.1016/0041-5553(80)90061-0
10.1016/S0166-218X(02)00571-1
10.1007/s002249910009
10.1016/j.orl.2016.07.004
10.1007/BF02579150
10.1016/j.disc.2013.01.008
10.1561/0100000006
ContentType Journal Article
Copyright 2017 Elsevier B.V.
Copyright Elsevier BV Aug 20, 2017
Copyright_xml – notice: 2017 Elsevier B.V.
– notice: Copyright Elsevier BV Aug 20, 2017
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.dam.2017.04.025
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 20
ExternalDocumentID 10_1016_j_dam_2017_04_025
S0166218X17301919
GroupedDBID -~X
ADEZE
AFTJW
ALMA_UNASSIGNED_HOLDINGS
FDB
OAUVE
AAYXX
AI.
CITATION
FA8
VH1
WUQ
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c277t-f87cd74336e71e90ea085d2b7c60a65b4edce553c096292ade3d0b2911fe811a3
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000404502700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Sun Jun 29 16:17:03 EDT 2025
Sat Nov 29 02:59:37 EST 2025
Sat Apr 29 22:38:48 EDT 2023
IsPeerReviewed true
IsScholarly true
Keywords Dominating set problem
Boolean linear programming
Independent set problem
Matrix minor
Efficient algorithm
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c277t-f87cd74336e71e90ea085d2b7c60a65b4edce553c096292ade3d0b2911fe811a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7529-8233
PQID 1932080792
PQPubID 2045487
PageCount 8
ParticipantIDs proquest_journals_1932080792
crossref_primary_10_1016_j_dam_2017_04_025
elsevier_sciencedirect_doi_10_1016_j_dam_2017_04_025
PublicationCentury 2000
PublicationDate 2017-08-20
PublicationDateYYYYMMDD 2017-08-20
PublicationDate_xml – month: 08
  year: 2017
  text: 2017-08-20
  day: 20
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Discrete Applied Mathematics
PublicationYear 2017
Publisher Elsevier B.V
Elsevier BV
Publisher_xml – name: Elsevier B.V
– name: Elsevier BV
References Khachiyan (b7) 1980; 20
Pardalos, Han, Ye (b11) 1991; 19
Kobler, Rotics (b8) 2003; 126
Alekseev, Zakharova (b1) 2011; 5
Lozin, Millanic (b9) 2013; 313
Karmarkar (b6) 1984; 4
Courcelle, Makowsky, Rotics (b4) 2000; 33
Reed (b12) 1999; 19
Gray (b5) 2006; 2
Shevchenko (b13) 1997
Veselov, Chirkov (b14) 2009; 6
Whitesides (b15) 1984; 88
Brandstädt, Dragan (b3) 2003; 129
Nesterov, Nemirovsky (b10) 1994
Artmann, Eisenbrand, Glanzer, Oertel, Vempala, Weismantel (b2) 2016; 44
Alekseev (10.1016/j.dam.2017.04.025_b1) 2011; 5
Reed (10.1016/j.dam.2017.04.025_b12) 1999; 19
Gray (10.1016/j.dam.2017.04.025_b5) 2006; 2
Khachiyan (10.1016/j.dam.2017.04.025_b7) 1980; 20
Whitesides (10.1016/j.dam.2017.04.025_b15) 1984; 88
Nesterov (10.1016/j.dam.2017.04.025_b10) 1994
Lozin (10.1016/j.dam.2017.04.025_b9) 2013; 313
Kobler (10.1016/j.dam.2017.04.025_b8) 2003; 126
Pardalos (10.1016/j.dam.2017.04.025_b11) 1991; 19
Shevchenko (10.1016/j.dam.2017.04.025_b13) 1997
Artmann (10.1016/j.dam.2017.04.025_b2) 2016; 44
Courcelle (10.1016/j.dam.2017.04.025_b4) 2000; 33
Brandstädt (10.1016/j.dam.2017.04.025_b3) 2003; 129
Karmarkar (10.1016/j.dam.2017.04.025_b6) 1984; 4
Veselov (10.1016/j.dam.2017.04.025_b14) 2009; 6
References_xml – volume: 19
  start-page: 267
  year: 1999
  end-page: 296
  ident: b12
  article-title: Mangoes and blueberries
  publication-title: Combinatorica
– volume: 126
  start-page: 197
  year: 2003
  end-page: 221
  ident: b8
  article-title: Edge dominating set and colorings on graphs with fixed clique-width
  publication-title: Discrete Appl. Math.
– year: 1994
  ident: b10
  publication-title: Interior Point Polynomial Methods in Convex Programming
– volume: 19
  start-page: 45
  year: 1991
  end-page: 54
  ident: b11
  article-title: Interior point algorithms for solving nonlinear optimization problems
  publication-title: COAL Newsl.
– volume: 6
  start-page: 220
  year: 2009
  end-page: 222
  ident: b14
  article-title: Integer program with bimodular matrix
  publication-title: Discrete Optim.
– volume: 129
  start-page: 285
  year: 2003
  end-page: 303
  ident: b3
  article-title: On linear and circular structure of (claw, net)-free graphs
  publication-title: Discrete Appl. Math.
– volume: 313
  start-page: 1035
  year: 2013
  end-page: 1044
  ident: b9
  article-title: Critical properties of graphs of bounded clique-width
  publication-title: Discrete Math.
– year: 1997
  ident: b13
  publication-title: Qualitative Topics in Integer Linear Programming
– volume: 44
  start-page: 635
  year: 2016
  end-page: 639
  ident: b2
  article-title: A note on non-degenerate integer programs with small sub-determinants
  publication-title: Oper. Res. Lett.
– volume: 33
  start-page: 125
  year: 2000
  end-page: 150
  ident: b4
  article-title: Linear time solvable optimization problems on graphs of bounded clique-width
  publication-title: Theory Comput. Syst.
– volume: 4
  start-page: 373
  year: 1984
  end-page: 395
  ident: b6
  article-title: A new polynomial time algorithm for linear programming
  publication-title: Combinatorica
– volume: 2
  start-page: 155
  year: 2006
  end-page: 239
  ident: b5
  article-title: Toeplitz and circulant matrices: a review
  publication-title: Found. Trends Commun. Inf. Theory
– volume: 5
  start-page: 14
  year: 2011
  end-page: 18
  ident: b1
  article-title: Independent sets in the graphs with bounded minors of the extended incidence matrix
  publication-title: J. Appl. Ind. Math.
– volume: 88
  start-page: 281
  year: 1984
  end-page: 297
  ident: b15
  article-title: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs
  publication-title: Ann. Discrete Math.
– volume: 20
  start-page: 53
  year: 1980
  end-page: 72
  ident: b7
  article-title: Polynomial algorithms in linear programming
  publication-title: USSR Comput. Math. Math. Phys.
– volume: 88
  start-page: 281
  year: 1984
  ident: 10.1016/j.dam.2017.04.025_b15
  article-title: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs
  publication-title: Ann. Discrete Math.
– volume: 19
  start-page: 45
  year: 1991
  ident: 10.1016/j.dam.2017.04.025_b11
  article-title: Interior point algorithms for solving nonlinear optimization problems
  publication-title: COAL Newsl.
– volume: 6
  start-page: 220
  issue: 2
  year: 2009
  ident: 10.1016/j.dam.2017.04.025_b14
  article-title: Integer program with bimodular matrix
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2008.12.002
– volume: 126
  start-page: 197
  issue: 2–3
  year: 2003
  ident: 10.1016/j.dam.2017.04.025_b8
  article-title: Edge dominating set and colorings on graphs with fixed clique-width
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00198-1
– volume: 19
  start-page: 267
  issue: 2
  year: 1999
  ident: 10.1016/j.dam.2017.04.025_b12
  article-title: Mangoes and blueberries
  publication-title: Combinatorica
  doi: 10.1007/s004930050056
– volume: 5
  start-page: 14
  issue: 1
  year: 2011
  ident: 10.1016/j.dam.2017.04.025_b1
  article-title: Independent sets in the graphs with bounded minors of the extended incidence matrix
  publication-title: J. Appl. Ind. Math.
  doi: 10.1134/S1990478911010029
– volume: 20
  start-page: 53
  issue: 1
  year: 1980
  ident: 10.1016/j.dam.2017.04.025_b7
  article-title: Polynomial algorithms in linear programming
  publication-title: USSR Comput. Math. Math. Phys.
  doi: 10.1016/0041-5553(80)90061-0
– volume: 129
  start-page: 285
  issue: 2–3
  year: 2003
  ident: 10.1016/j.dam.2017.04.025_b3
  article-title: On linear and circular structure of (claw, net)-free graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(02)00571-1
– year: 1994
  ident: 10.1016/j.dam.2017.04.025_b10
– volume: 33
  start-page: 125
  issue: 2
  year: 2000
  ident: 10.1016/j.dam.2017.04.025_b4
  article-title: Linear time solvable optimization problems on graphs of bounded clique-width
  publication-title: Theory Comput. Syst.
  doi: 10.1007/s002249910009
– volume: 44
  start-page: 635
  issue: 5
  year: 2016
  ident: 10.1016/j.dam.2017.04.025_b2
  article-title: A note on non-degenerate integer programs with small sub-determinants
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2016.07.004
– volume: 4
  start-page: 373
  issue: 4
  year: 1984
  ident: 10.1016/j.dam.2017.04.025_b6
  article-title: A new polynomial time algorithm for linear programming
  publication-title: Combinatorica
  doi: 10.1007/BF02579150
– volume: 313
  start-page: 1035
  issue: 9
  year: 2013
  ident: 10.1016/j.dam.2017.04.025_b9
  article-title: Critical properties of graphs of bounded clique-width
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2013.01.008
– volume: 2
  start-page: 155
  issue: 3
  year: 2006
  ident: 10.1016/j.dam.2017.04.025_b5
  article-title: Toeplitz and circulant matrices: a review
  publication-title: Found. Trends Commun. Inf. Theory
  doi: 10.1561/0100000006
– year: 1997
  ident: 10.1016/j.dam.2017.04.025_b13
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.2139874
Snippet We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 13
SubjectTerms Boolean algebra
Boolean linear programming
Combinatorics
Dominating set problem
Efficient algorithm
Formulations
Graphs
Independent set problem
Linear programming
Mathematical analysis
Matrix
Matrix methods
Matrix minor
Title The computational complexity of three graph problems for instances with bounded minors of constraint matrices
URI https://dx.doi.org/10.1016/j.dam.2017.04.025
https://www.proquest.com/docview/1932080792
Volume 227
WOSCitedRecordID wos000404502700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5ByqEcEE9RKGgPiAORJXv9WPtYQcpDaUAirXxb7a7XqivFCYlb5ed39mWnRVRw4GJFGzlyZj7Pfjs7-w1C76I6IiqWVcBlzQOYb7MgjzMZRLEUheAxLUw14dmUzmZ5WRY_3FbMxrQToG2bb7fF6r-6GsbA2fro7D-4u_9RGIDP4HS4gtvh-teOl6ZXg8_zmbJxtXXFFx14T42NUPXYtZMxmgy6LL3TGHAH3oRuuAR0dNG0uiGPKT_XcrO8abvxwij7u_pDx20_NRCCgIP3zPakl4TtifvndSN4u7wyoa6vrz3Rwijnyo7-3E1EwOQWasMP2bH-hMzZbr4yywJgEaWdbmyMzSkJMmo7r_ggTKxCgAuj9njqb9HdJhou4BG0hkBEjUitPTd9U0l79p0dn06nbD4p5-9XvwLdZExvxruOK_fRHqFpkY_Q3tHXSfltR29Mi-nt-wzdsCEFxCxxMvH2__gNclMqeOt5_kRxbk32hsHMH6NHbumBjyxknqB7qn2KHu446RlaAHjwDfDgATx4WWMDHmzAgz14MIAH9-DBGjzYgQdb8Og7B_BgD57n6PR4Mv_4JXANOQJJKO2COqeyAsoZZ4pGqggVB8JeEUFlFvIsFYkuKU7TWMK6mBSEVyquQkFgPq1VHkU8foFG7bJVLxGuI5XzhISk0BkamgoCsUSEUkRJnSlBD9AHb0O2srorzBckXjAwONMGZ2HCwOAHKPFWZo44WkLIADl33XboPcLcC7xhekEDqyhakFd3f_0a7Q9vwSEadetL9QY9kFdds1m_dci6Bth9mBM
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+computational+complexity+of+three+graph+problems+for+instances+with+bounded+minors+of+constraint+matrices&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Gribanov%2C+DV&rft.au=Malyshev%2C+DS&rft.date=2017-08-20&rft.pub=Elsevier+BV&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=227&rft.spage=13&rft_id=info:doi/10.1016%2Fj.dam.2017.04.025&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon