发布求助
文献互助 智能选刊 最新文献

Anais do Encontro de Teoria da Computação (ETC)最新文献

筛选
英文 中文
Half Cuts em Grafos Bipartidos Completos 完全二部图的半切
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/etc.2018.3161
Rubens Sucupira, Sulamita Klein, Luerbio Faria
{"title":"Half Cuts em Grafos Bipartidos Completos","authors":"Rubens Sucupira, Sulamita Klein, Luerbio Faria","doi":"10.5753/etc.2018.3161","DOIUrl":"https://doi.org/10.5753/etc.2018.3161","url":null,"abstract":"Um grafo é Half Cut se admite um corte de arestas de cardinalidade d m2 e. É sabido que grafos graciosos são Half Cut e os grafos bipartidos completos são graciosos. Neste artigo damos uma prova alternativa de que os grafos bipartidos completos são Half Cut, exibindo um corte de arestas de cardinalidade d m2 e.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116592577","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
Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem 最大容量代表问题的精确和启发式方法
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3164
I. E. D. Souza, Mauro Roberto Costa da Silva, Welverton R. Silva, Rafael C. S. Schoeury
{"title":"Exact and Heuristic Approaches to the Maximum Capacity Representatives Problem","authors":"I. E. D. Souza, Mauro Roberto Costa da Silva, Welverton R. Silva, Rafael C. S. Schoeury","doi":"10.5753/ETC.2018.3164","DOIUrl":"https://doi.org/10.5753/ETC.2018.3164","url":null,"abstract":"This paper approaches the problem of finding the system of representatives of a family of disjoint sets. To solve this problem, three methods were used: integer programming, branch-and-bound, and the BRKGA metaheuristic. We observed that, in randomly generated instances, the branch-and-bound algorithm was the best exact method but it was surpassed by BRKGA for large instances.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117237632","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
On Total and Edge-colouring of Proper Circular-arc Graphs 适当圆弧图的全着色和边着色
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3557
J. Bernardi, S. M. Almeida, L. M. Zatesko
{"title":"On Total and Edge-colouring of Proper Circular-arc Graphs","authors":"J. Bernardi, S. M. Almeida, L. M. Zatesko","doi":"10.5753/ETC.2018.3557","DOIUrl":"https://doi.org/10.5753/ETC.2018.3557","url":null,"abstract":"Deciding if a graph is Δ-edge-colourable (resp. (Δ + 1)-total colourable), although it is an NP-complete problem for graphs in general, is polynomially solvable for interval graphs of odd (resp. even) maximum degree Δ. An interesting superclass of the proper interval graphs are the proper circular-arc graphs, for which we suspect that Δ-edge-colourability is linear-time decidable. This work presents sufficient conditions for Δ-edge-colourability, (Δ + 1)-total colourability, and (Δ+2)-total colourability of proper circular-arc graphs. Our proofs are constructive and yield polynomial-time algorithms.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125320918","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}
引用次数: 1
Implementações Eficientes da Heurística Min-Min para o HCSP em GPU 在GPU上高效实现HCSP的最小启发式
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3156
R. Schmid, E. N. Cáceres
{"title":"Implementações Eficientes da Heurística Min-Min para o HCSP em GPU","authors":"R. Schmid, E. N. Cáceres","doi":"10.5753/ETC.2018.3156","DOIUrl":"https://doi.org/10.5753/ETC.2018.3156","url":null,"abstract":"Min-min heuristic is one of the most indicated algorithm to solve HCSP, when we are looking for performance. A previous result presented an efficient implementation to this problem with assymptotic complexity O(t log(t)m). In this work, we implement this problem with linear complexity. Our implementation is competitive with the previous results. 1. Introdução A utilização de grades computacionais e computação em nuvem têm obtido bons resultados na solução de problemas complexos. De uma forma geral, grades computacionais e computação em nuvem são compostas de vários comutadores heterogêneos que são capazes de trabalhar de forma cooperativa.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195645","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}
引用次数: 2
Vertex partition problems in digraphs ⇤ 有向图中的顶点划分问题
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/etc.2018.3174
M. Sambinelli, C. N. Lintzmayer, C. N. D. Silva, Orlando Lee
{"title":"Vertex partition problems in digraphs ⇤","authors":"M. Sambinelli, C. N. Lintzmayer, C. N. D. Silva, Orlando Lee","doi":"10.5753/etc.2018.3174","DOIUrl":"https://doi.org/10.5753/etc.2018.3174","url":null,"abstract":"Let D be a digraph and k be a positive integer. Linial (1981) conjectured that the k-norm of a k-minimum path partition of a digraph D is at most max{PC2 C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it. It is well known that Berge's Conjecture implies Linial's Conjecture. In this work, we verify Berge's Conjecture, and consequently Linial's Conjecture, for locally in-semicomplete digraphs and k-minimum path partitions containing only two paths. Moreover, we verify a conjecture related to Berge's and Linial's Conjectures for locally in-semicomplete digraphs.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132980564","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}
引用次数: 1
Ramsey-type problems in orientations of graphs ⇤ 图的定向中的ramsey型问题
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/etc.2018.3172
B. P. Cavalar
{"title":"Ramsey-type problems in orientations of graphs ⇤","authors":"B. P. Cavalar","doi":"10.5753/etc.2018.3172","DOIUrl":"https://doi.org/10.5753/etc.2018.3172","url":null,"abstract":"The Ramsey number R(H) of a graph H is the minimum number n such that there exists a graph G on n vertices with the property that every two-coloring of its edges contains a monochromatic copy of H. In this work we study a variant of this notion, called the oriented Ramsey problem, for an acyclic oriented graph H~ , in which we require that every orientation G~ of the graph G contains a copy of H~ . We also study the threshold function for this problem in random graphs. Finally, we consider the isometric case, in which we require the copy to be isometric, by which we mean that, for every two vertices x, y 2 V (H~ ) and their respective copies x0, y0 in G~ , the distance between x and y is equal to the distance between x0 and y0.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123981271","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}
引用次数: 2
Algoritmo Eficiente para Quebra de Privacidade em Redes Sociais Anonimizadas 在匿名社交网络中侵犯隐私的有效算法
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3137
Pamela Tabak, Daniel R. Figueiredo
{"title":"Algoritmo Eficiente para Quebra de Privacidade em Redes Sociais Anonimizadas","authors":"Pamela Tabak, Daniel R. Figueiredo","doi":"10.5753/ETC.2018.3137","DOIUrl":"https://doi.org/10.5753/ETC.2018.3137","url":null,"abstract":"Empresas que controlam redes sociais muitas vezes disponibilizam dados, incluindo a rede de relacionamento entre seus usuários, removendo a identidade deles para preservar sua privacidade. Este trabalho define e avalia uma metodologia de duas fases para revelar relacionamentos entre usuários de uma rede social. Na primeira, nós (usuários) artificiais são inseridos e conectados a um grupo de usuários vítimas. A segunda fase identifica os nós artificiais na rede anonimizada e revela os relacionamentos entre os usuários vítimas. Os algoritmos foram implementados e os resultados indicam que eles são eficientes em revelar os relacionamentos entre vítimas, quebrando sua privacidade.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125068801","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
Limite Superior para o Problema da Diversidade Máxima
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3138
Pablo Soares, Manoel B. Campêlo
{"title":"Limite Superior para o Problema da Diversidade Máxima","authors":"Pablo Soares, Manoel B. Campêlo","doi":"10.5753/ETC.2018.3138","DOIUrl":"https://doi.org/10.5753/ETC.2018.3138","url":null,"abstract":"We apply the t-linearization to the straightforward 0 1 quadratic model for the maximum diversity problem. We computationally compare the obtained model with two other linear formulations from the literature. Computational experiments show that the t-linearization generates, on average, fewer constraints than the formulations, in addition to achieving a tighter upper bound in all used instances. On the other hand, one of the formulations can be slightly faster in obtaining the bounds.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"11 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125742285","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}
引用次数: 1
Tratabilidade por Parâmetro Fixo para Largura em Árvore de Grafos Direcionados⇤ 有向图树宽度的固定参数可处理
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3163
A. Maia, R. Lopes, V. A. Campos
{"title":"Tratabilidade por Parâmetro Fixo para Largura em Árvore de Grafos Direcionados⇤","authors":"A. Maia, R. Lopes, V. A. Campos","doi":"10.5753/ETC.2018.3163","DOIUrl":"https://doi.org/10.5753/ETC.2018.3163","url":null,"abstract":"A largura em árvore de um grafo não-direcionado G é uma medida de quão similar G é de uma árvore. Uma definição análoga também é conhecida para grafos direcionados. Para k constante, nós melhoramos um resultado conhecido mostrando um algoritmo FPT, com parâmetro k, que decide se a largura em árvore de um grafo direcionado D é no máximo 3k 2 ou se D admite um refúgio de ordem k.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128762880","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
Online Circle and Sphere Packing∗ 在线圆与球填充*
Anais do Encontro de Teoria da Computação (ETC) Pub Date : 2018-07-26 DOI: 10.5753/ETC.2018.3158
C. N. Lintzmayer, F. Miyazawa, E. C. Xavier
{"title":"Online Circle and Sphere Packing∗","authors":"C. N. Lintzmayer, F. Miyazawa, E. C. Xavier","doi":"10.5753/ETC.2018.3158","DOIUrl":"https://doi.org/10.5753/ETC.2018.3158","url":null,"abstract":"In the Online Circle Packing in Squares, circles arrive one at a time and we need to pack them into the minimum number of unit square bins. We improve the previous best-known competitive ratio for the bounded space version from 2.439 to 2.3536 and we also give an unbounded space algorithm. Our algorithms also apply to the Online Circle Packing in Isosceles Right Triangles and Online Sphere Packing in Cubes, for which no previous results were known.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118758","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信