Filters








54,189 Hits in 5.5 sec

Subject Index

<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/usw2n4yaarcurchx7i4on2iqea" style="color: black;">Journal of Discrete Algorithms</a> </i> &nbsp;
Local edition Local similarity between quotiented ordered trees, 23 Local ratio Admission control with advance reservations in simple networks, 491 Local vertex coloring Local solutions for global  ...  network Routing of single-source and multiple-source queries in static sensor networks, 1 Word A simple fast hybrid pattern-matching algorithm, 682 zero-space A Zero-Space algorithm for Negative Cost  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(07)00076-7">doi:10.1016/s1570-8667(07)00076-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wfqxglrznfb6do3wyittd5pfbi">fatcat:wfqxglrznfb6do3wyittd5pfbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416024630/https://core.ac.uk/download/pdf/82335072.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/d0/f7d0214957c947cdc36ee7436319c4ee93013679.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s1570-8667(07)00076-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Acceleration Based Particle Swarm Optimization for Graph Coloring Problem

Jitendra Agrawal, Shikha Agrawal
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a> </i> &nbsp;
Particle swarm optimization is simple and powerful technique but its main drawback is its ability of being trapped in the local optimum.  ...  A swarm intelligence based technique called as particle swarm optimization is therefore employed to solve the graph coloring problem.  ...  In their paper a generic tabu search is introduced for three coloring problems such as graph coloring, T coloring and set T coloring.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2015.08.223">doi:10.1016/j.procs.2015.08.223</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mycmrbqd6zbnrfyjotno3juzwq">fatcat:mycmrbqd6zbnrfyjotno3juzwq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416062156/https://core.ac.uk/download/pdf/82162660.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/e7/e5e72afcb36dc3814e79996fee51a81e4508aa33.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2015.08.223"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Comparative Performance of Modified Simulated Annealing with Simple Simulated Annealing for Graph Coloring Problem

Anindya Jyoti Pal, Biman Ray, Nordin Zakaria, Samar Sen Sarma
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a> </i> &nbsp;
Here, we have designed modified Simulated Annealing (MSA) for optimal vertex coloring of a simple, symmetric and connected graph (GCP).  ...  Coloring of the vertices of a graph with minimum number of colours belongs to the same category, where the algorithm designers are trying to propose some new algorithms for better result.  ...  A tabu search implementation for graph coloring was proposed by Hertz and Werra [21] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2012.04.034">doi:10.1016/j.procs.2012.04.034</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mfal6ftu7bemfmei2kaatgpt7i">fatcat:mfal6ftu7bemfmei2kaatgpt7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190219220436/https://core.ac.uk/download/pdf/82553786.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/08/bc/08bc504aafd79ba171a75b807f201889499665ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2012.04.034"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring [article]

Anh Mac, David Perkins
<span title="2021-08-20">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This heuristic, combined with a series of other greedy optimizations, allows for a fast algorithm that prevents certain color conflicts.  ...  In this paper, we propose a high-speed greedy sequential algorithm for the vertex coloring problem (VCP), based on the Wave Function Collapse algorithm, called Wave Function Collapse Coloring (WFC-C).  ...  For example, [27] introduces a population-based approach with gradient descent optimization, and [28] uses probability learning on a local search algorithm to produce more optimal colorings.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.09329v1">arXiv:2108.09329v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vaes2bpq3rftznltf3iq7bfh5y">fatcat:vaes2bpq3rftznltf3iq7bfh5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210830230719/https://arxiv.org/pdf/2108.09329v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e0/3e/e03eca09824b1461018cdea19a3592da3cdde024.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2108.09329v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient coloring of a large spectrum of graphs

Darko Kirovski, Miodrag Potkonjak
<span title="">1998</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5vn6yyeefbbxtoo3uhwxwjwtme" style="color: black;">Proceedings of the 35th annual conference on Design automation conference - DAC &#39;98</a> </i> &nbsp;
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algorithm's performance.  ...  leastconstraining colors, reuse and locality exploration of intermediate solutions, search time management, post-processing lottery-scheduling iterative improvement, and statistical parameter determination  ...  Important property of the objective function is its local computation and usage of simple search operations such as remove node and add node from/to the current independent set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/277044.277165">doi:10.1145/277044.277165</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dac/KirovskiP98.html">dblp:conf/dac/KirovskiP98</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hqzmmcyaqjbgpbi56dcahy62zy">fatcat:hqzmmcyaqjbgpbi56dcahy62zy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20031105195935/http://www.sigda.org:80/Archives/ProceedingArchives/Dac/Dac98/papers/1998/dac98/pdffiles/26_1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/96/e796c1a9e1306c1b0199c276b06c76d6c063417d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/277044.277165"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape

Simon J. Larsen, Jan Baumbach
<span title="2017-06-27">2017</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fvl4m6o2tre4pcvl4ljymxu4ly" style="color: black;">Journal of Integrative Bioinformatics</a> </i> &nbsp;
Our algorithm uses an iterative local search heuristic for computing conserved subgraphs, optimizing a squared edge conservation score that is able to detect not only fully conserved edges but also partially  ...  To aid such analyses we have developed CytoMCS, a Cytoscape app for computing inexact solutions to the maximum common edge subgraph problem for two or more graphs.  ...  CytoMCS provides a simple interface allowing researchers to search for a common subgraph conserved between two or more graphs, using a fast iterative local search heuristic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/jib-2017-0014">doi:10.1515/jib-2017-0014</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/28731857">pmid:28731857</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3i2qo4i7ajgancdbsaxw7tu7m4">fatcat:3i2qo4i7ajgancdbsaxw7tu7m4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428013331/https://findresearcher.sdu.dk:8443/ws/files/125725355/CytoMCS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/5d/fb5d682684c0c6dd73c4956d9db9bd695b4d16ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/jib-2017-0014"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> degruyter.com </button> </a>

APPLICATIONS OF STATISTICAL MECHANICS TO COMBINATORIAL SEARCH PROBLEMS [chapter]

TAD HOGG
<span title="">1995</span> <i title="WORLD SCIENTIFIC"> Annual Reviews of Computational Physics II </i> &nbsp;
In this paper, we summarize these results for one type of combinatorial search, constraint satisfaction [35], using the particular problem of graph coloring as an example.  ...  governed by a simple euclidean metric.  ...  Each graph was then searched using a simple, nonheuristic backtrack search in which nodes were colored in numerical order (for graphs this small, the Brelaz heuristic is usually able to find a solution  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812831149_0009">doi:10.1142/9789812831149_0009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jg7d52dlh5axnkccilovxtbctu">fatcat:jg7d52dlh5axnkccilovxtbctu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070221183158/http://www.hpl.hp.com:80/research/idl/projects/constraints/searchStatMechReview.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/6f/a26f773987fba39b144cf854bcb624742edfb156.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789812831149_0009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Daniel Cosmin Porumbel
<span title="2011-12-13">2011</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a7azxtgamnavvcktn5y7xrjas4" style="color: black;">4OR</a> </i> &nbsp;
devised a fast method to record the spheres of local minima visited by a local search process.  ...  Partition Distance: Graph Coloring Interpretation and Fast Calculation 2.  ...  A coloring is a particular case of a partition, and so, the partition distance has often been used for graph coloring.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-011-0193-5">doi:10.1007/s10288-011-0193-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nihv44ivizh3fgo7vwo2kynwka">fatcat:nihv44ivizh3fgo7vwo2kynwka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811100444/http://www.info.univ-angers.fr/pub/porumbel/papers/theseEn.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/f6/86f629604894bd06943b86ea19f3a0a75c1e198a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10288-011-0193-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING

DANIEL COSMIN PORUMBEL, JIN-KAO HAO, PASCALE KUNTZ
<span title="">2013</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j7owhsjvm5hxdh64bwjuze73pm" style="color: black;">Asia-Pacific Journal of Operational Research</a> </i> &nbsp;
Tabu Search (TS) has always been a very popular algorithm for graph coloring, both as a stand-alone optimizer as well as a subroutine inside population-based hybrid methods.  ...  The second extension concerns a reactive mechanism for improving the tabu list management.  ...  Tabu Search is routinely used for graph coloring, both as a stand-alone algorithm, as well as a local optimizer inside state-of-the-art hybrid methods.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0217595913500103">doi:10.1142/s0217595913500103</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v7lxaen6svfsjle3r2cxazgb3u">fatcat:v7lxaen6svfsjle3r2cxazgb3u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222051954/http://pdfs.semanticscholar.org/3417/a3639e44d1edb7c69c7e6df357e8fb71ba0b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/34/17/3417a3639e44d1edb7c69c7e6df357e8fb71ba0b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0217595913500103"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Coloring large complex networks

Ryan A. Rossi, Nesreen K. Ahmed
<span title="2014-09-12">2014</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3xvqvdkqejfvdeozx2l3c3rxti" style="color: black;">Social Network Analysis and Mining</a> </i> &nbsp;
Overall, the coloring methods are shown to be (1) accurate with solutions close to optimal, (2) fast and scalable for large networks, and (3) flexible for use in a variety of applications.  ...  We also propose a parallel algorithm for the problem of coloring neighborhood subgraphs and make several key observations.  ...  Acknowledgments We thank the anonymous reviewers for their constructive and helpful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13278-014-0228-y">doi:10.1007/s13278-014-0228-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6cmetomlsvaldf5mdigfjdjgxe">fatcat:6cmetomlsvaldf5mdigfjdjgxe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160402210602/http://ryanrossi.com/papers/rossi-ahmed-SNAM2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/4f/a54fe93fda230523b48b0cdf5f5d13ef00bc84c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s13278-014-0228-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Coloring Large Complex Networks [article]

Ryan A. Rossi, Nesreen K. Ahmed
<span title="2014-08-26">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Overall, the coloring methods are shown to be (i) accurate with solutions close to optimal, (ii) fast and scalable for large networks, and (iii) flexible for use in a variety of applications.  ...  We also propose a parallel algorithm for the problem of coloring neighborhood subgraphs and make several key observations.  ...  The local clique search terminates if |P t | + |C v | ≤ C max , since this indicates that a clique of a larger size cannot be found from searching further. See Figure 4 for a simple example.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.3448v3">arXiv:1403.3448v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/guwoxrt2pfa5jhqp5ibfan7cyq">fatcat:guwoxrt2pfa5jhqp5ibfan7cyq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200917170924/https://arxiv.org/pdf/1403.3448v2.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/9a/f49afd2c08d099dac0f7750708c809000dfcc427.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1403.3448v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Coloring Big Graphs with AlphaGoZero [article]

Jiayi Huang, Mostofa Patwary, Gregory Diamos
<span title="2019-11-08">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
As a result, we are able to learn new state of the art heuristics for graph coloring.  ...  Key to our approach is the introduction of a novel deep neural network architecture (FastColorNet) that has access to the full graph context and requires O(V) time and space to color a graph with V vertices  ...  After choosing a move, we run MCTS for several consecutive moves to avoid resetting the search. We use a fast (smaller) model to fast-forward to the next sampled move.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.10162v3">arXiv:1902.10162v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vr625w5fgbf4loln2za3nb4hqm">fatcat:vr625w5fgbf4loln2za3nb4hqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200904013614/https://arxiv.org/pdf/1902.10162v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3f/4d/3f4daf29820e1b9d2139ec2984b8987064d2796f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.10162v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [chapter]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain  ...  For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques.  ...  We are grateful to Till Fluschnik and Vincent Froese for feedback to our manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-53174-7_1">doi:10.1007/978-3-662-53174-7_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kegsdk75mncyhjecqz3ztmtffa">fatcat:kegsdk75mncyhjecqz3ztmtffa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721223746/https://fpt.akt.tu-berlin.de/publications/graphmod-wg15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/40/f0/40f031f877617df99b025e658857b307f2d0eec7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-53174-7_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics [article]

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier
<span title="2016-06-10">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain  ...  For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques.  ...  We are grateful to Till Fluschnik and Vincent Froese for feedback to our manuscript.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.03268v1">arXiv:1606.03268v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6ucc6vh32rfajofrbdsxtcpznq">fatcat:6ucc6vh32rfajofrbdsxtcpznq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025045446/https://arxiv.org/pdf/1606.03268v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/ce/cece0ef981492ee75a3f1c4001b858beb9175148.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1606.03268v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Hybrid DCOP Solvers: Boosting Performance of Local Search Algorithms [article]

Cornelis Jan van Leeuwen, Przemyzław Pawełczak
<span title="2020-09-04">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose a novel method for expediting both symmetric and asymmetric Distributed Constraint Optimization Problem (DCOP) solvers.  ...  The core idea is based on initializing DCOP solvers with greedy fast non-iterative DCOP solvers.  ...  Solution quality improvement over initial assignment : most probably a simple initialization method will find a sub-optimal solution, and many local search algorithms will be able to improve it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.02240v1">arXiv:2009.02240v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/io5cgbgwozgfbeotqhcwhmldyu">fatcat:io5cgbgwozgfbeotqhcwhmldyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201004005531/https://arxiv.org/pdf/2009.02240v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.02240v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 54,189 results