Electronic Notes in Discrete Mathematics最新文献_第5页

The Single Polybag Loading Problem 单塑料袋装载问题

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.010

Yuxin Che , Ying Liu , Qiang Gao , Andrew Lim , Qian Hu

引用次数: 0

Chordal-(2,1) graph sandwich problem with boundary conditions 具有边界条件的Chordal-(2,1)图三明治问题

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.036

Fernanda Couto , Luerbio Faria , Sylvain Gravier , Sulamita Klein

{"title":"Chordal-(2,1) graph sandwich problem with boundary conditions","authors":"Fernanda Couto , Luerbio Faria , Sylvain Gravier , Sulamita Klein","doi":"10.1016/j.endm.2018.07.036","DOIUrl":"10.1016/j.endm.2018.07.036","url":null,"abstract":"<div>In this work, we consider the graph sandwich problem for a property Π, a decision problem proposed by Golumbic, Kaplan, and Shamir as follows: given two graphs G1 = (V, E1) and G2 = (V, E2), the question is whether there exists a graph G = (V, E) such that E1 ⊆ E ⊆ E2 and G satisfies Π. For many graph classes, this problem was settled to be NP-complete. For this reason, a different kind of approach has been proposed: instead of focusing only on property Π, we can also require special properties <math><msup><mrow><mi>Π</mi></mrow><mrow><mi>i</mi></mrow></msup></math> for the input graphs Gi, i = 1, 2, resulting in a problem that generalizes graph sandwich problems, called graph sandwich problems with boundary conditions. This problem is denoted by a triple (<math><msup><mrow><mi>Π</mi></mrow><mrow><mn>1</mn></mrow></msup></math>, Π, <math><msup><mrow><mi>Π</mi></mrow><mrow><mn>2</mn></mrow></msup></math>)-sp. We deal with the property Π of being a chordal-(2,1)-graph when it is given that G2 is a graph of a class for which there is a polynomial bound on the number of cliques, say pnc. chordal-(2,1)-sp is known to be NP-complete but, when requiring G2 to be of a class in pnc, we prove that (*, chordal-(2,1), pnc)-sp is polynomially time solvable.</div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125788877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Designing Pedibus Lines: a Path Based Approach 设计Pedibus线路:基于路径的方法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.020

Federico Malucelli, Emanuele Tresoldi, Maddalena Nonato

引用次数: 2

Closure of genomic sets: applications of graph convexity to genome rearrangement problems 基因组集的闭包:图凸性在基因组重排问题中的应用

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.037

Luís Cunha , Fábio Protti

{"title":"Closure of genomic sets: applications of graph convexity to genome rearrangement problems","authors":"Luís Cunha , Fábio Protti","doi":"10.1016/j.endm.2018.07.037","DOIUrl":"10.1016/j.endm.2018.07.037","url":null,"abstract":"<div>Genome rearrangement problems aim at finding the minimum number of mutational events required to transform a genome into another. Studying such problems from a combinatorial point of view has been proved to be useful for the reconstruction of phylogenetic trees. In this work we focus on the relations between genome rearrangement and graph convexity in the following way. Graph convexity problems deal with input sets of vertices and try to understand properties on the closure of such inputs. In turn, the concept of closure is useful for studies on genome rearrangement by suggesting mechanisms to reduce the genomic search space. Computational complexity studies are widely developed in graph convexity problems, since there are several types of convexities, each capturing a distinct way of defining what is meant by “closure”. In this regard, considering the Hamming distance of strings, we solve the following problems: decide whether a given set is convex; compute the interval and the convex hull of a given set; and determine the convexity number of a given graph. All such problems are solved for the geodesic and monophonic convexities. On the other hand, for the Cayley distance of permutations, we study convexity of sets and interval determination of sets, in the context of the geodesic convexity.</div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.037","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130003958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Characterization by forbidden induced subgraphs of some subclasses of chordal graphs 弦图若干子类的禁止诱导子图的刻画

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.011

Sérgio H. Nogueira , Vinicius F. dos Santos

{"title":"Characterization by forbidden induced subgraphs of some subclasses of chordal graphs","authors":"Sérgio H. Nogueira , Vinicius F. dos Santos","doi":"10.1016/j.endm.2018.07.011","DOIUrl":"10.1016/j.endm.2018.07.011","url":null,"abstract":"<div>Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set S is a vertex separator for vertices a and b if the removal of S of the graph separates a and b into distinct connected components. A graph G is chordal if and only if every minimal vertex separator is a clique. We study subclasses of chordal graphs defined by restrictions imposed on the intersections of its minimal separator cliques. Our goal is to characterize them by forbidden induced subgraphs. Some of these classes have already been studied such as chordal graphs in which two minimal separators have no empty intersection if and only if they are equal. Those graphs are known as strictly chordal graphs and they were first introduced as block duplicate graphs by Golumbic and Peled [Golumbic, M. C. and Peled, U. N., Block duplicate graphs and a hierarchy of chordal graphs, Discrete Applied Mathematics, 124 (2002) 67–71], they were also considered in [Kennedy, W., “Strictly chordal graphs and phylogenetic roots”, Master Thesis, University of Alberta, 2005] and [De Caria, P. and Gutiérrez, M., On basic chordal graphs and some of its subclasses, Discrete Applied Mathematics, 210 (2016) 261–276], showing that strictly chordal graphs are exactly the (gem, dart)-free graphs.</div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124512368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A branch and price approach for the Split Pickup and Split Delivery VRP 拆分取货和拆分交付VRP的分支和价格方法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.025

Marco Casazza , Alberto Ceselli , Roberto Wolfler Calvo

引用次数: 11

The Interference-aware Drone Ad-hoc Relay Network Configuration problem 干扰感知无人机自组织中继网络配置问题

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.041

Carla De Francesco, Luigi De Giovanni, Claudio Enrico Palazzi

引用次数: 7

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices 关于覆盖圆形矩阵多面体集合的面的Chvátal-rank

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.012

Graciela Nasini, Luis M. Torres, Hervé Kerivin, Annegret Wagler

引用次数: 0

Self-sufficient sets in smartgrids 智能电网中的自给自足装置

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.039

J. David, R. Grappe, M. Lacroix, E. Traversi

引用次数: 1

Order Batching and Routing in a Non-Standard Warehouse 非标准仓库中的订单批处理和路由

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.017

Ulrich Pferschy , Joachim Schauer

引用次数: 13