Filters

99,171 Hits in 3.2 sec

IC-Colorings and IC-Indices of graphs

<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
Given a coloring f : V (G)  ...  Maximum IC-indices of complete graphs and stars Theorem 2.1. For any complete graph K n , we have M(K n ) = 2 n − 1. Proof.  ...  In this paper we will examine some well-known classes of graphs and determine their IC-indices. All the graphs will be finite, simple, and undirected.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2004.02.026">doi:10.1016/j.disc.2004.02.026</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f42zgqveyfcx5k3esbvjrrznqm">fatcat:f42zgqveyfcx5k3esbvjrrznqm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170927081346/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/4ed/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAxMjM2NXgwNTAwMjgzOQ%3D%3D.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/ca/d7/cad78a55ef7316fd944a288bf209661391f40377.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2004.02.026"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Incremental list coloring of graphs, parameterized by conservation

Sepp Hartung, Rolf Niedermeier
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Incrementally k-list coloring a graph means that a graph is given by adding vertices step by step, and for each intermediate step we ask for a vertex coloring such that each vertex has one of the colors  ...  We show that even on biparite graphs the problem is NP-hard for k ≥ 3 and W[1]-hard for an unbounded number of colors when parameterized by c.  ...  We are grateful to Johannes Uhlmann and Mathias Weller for their comments concerning Theorem 11. We thank Ondřej  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2012.12.049">doi:10.1016/j.tcs.2012.12.049</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zyhrzsafbnddbbwwhpn2jjdot4">fatcat:zyhrzsafbnddbbwwhpn2jjdot4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151006233323/http://fpt.akt.tu-berlin.de/publications/Inc_List_Color_TCS.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/99/53/995382627680a3c8a47f7edf4d6de343dae0689e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2012.12.049"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The IC-indices of Some Complete Multipartite Graphs [article]

Chin-Lin Shiue, Hui-Chuan Lu
<span title="2016-10-02">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The IC-index of G, denoted as M(G), is the maximum value of f(G) over all possible IC-colorings f of G.  ...  ,f(G)}, there exists an induced connected subgraph H of G such that f(H) = k, then the coloring f is called an IC-coloring of G.  ...  Lower Bounds on the IC-indices of Complete Multipartite Graphs For the derivation of lower bounds, we view complete multipartite graphs as being generated by a graph operation starting with graphs with  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.00238v1">arXiv:1610.00238v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/br25nbfnoje6rosaduomvwyeyi">fatcat:br25nbfnoje6rosaduomvwyeyi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826190340/https://arxiv.org/pdf/1610.00238v1.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/ad/af/adafa8729fcaffff9cb4fccb24c188082b49323c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.00238v1" 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>

Recognizing IC-Planar and NIC-Planar Graphs [article]

Franz J. Brandenburg
<span title="2016-10-27">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In contrast, recognizing 3-connected IC-planar and NIC-planar graphs is NP-complete, even if the graphs are given with a rotation system which describes the cyclic ordering of the edges at each vertex.  ...  In consequence, planar-maximal and maximal IC-planar and NIC-planar graphs can be recognized in O(n^5) time and maximum and optimal ones in O(n^3) time.  ...  Each K 5 indices a kite and one of the two K 5 shall form a kite using only inner edges including the diagonal, see Fig. 9 .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.08884v1">arXiv:1610.08884v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/57ujl6sbpjazhhtprxcesfabxm">fatcat:57ujl6sbpjazhhtprxcesfabxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191022050328/https://arxiv.org/pdf/1610.08884v1.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/d0/77/d0775d7b37624c70ffaaea125eeaafe88a4e7f1b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1610.08884v1" 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>

An Early Warning Sign of Critical Transition in The Antarctic Ice Sheet – A Data Driven Tool for Spatiotemporal Tipping Point [article]

Abd AlRahman AlMomani, Erik Bollt
<span title="2020-12-31">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We apply a directed spectral clustering methodology, including an asymmetric affinity matrix and the associated directed graph Laplacian, to reprocess the ice velocity data and remote sensing satellite  ...  Here we interpret that it can also be used to indicate early warning signs of critical transitions in ice shelves as seen from remote sensing data.  ...  spatial scale and resolution of color histories.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2004.09724v2">arXiv:2004.09724v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cd6kssfh4ncizbrarlozq6bu6q">fatcat:cd6kssfh4ncizbrarlozq6bu6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200502131405/https://arxiv.org/pdf/2004.09724v1.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> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2004.09724v2" 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>

Frustration-induced Emergent Hilbert Space Fragmentation [article]

Kyungmin Lee, Arijeet Pal, Hitesh J. Changlani
<span title="2020-11-03">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Focusing our attention to the kagome lattice, we explicitly show the phenomenology of fragmentation in the Balents-Fisher-Girvin Hamiltonian relevant to the easy-axis (Ising) regime, and a three-coloring  ...  We study their level statistics, and initial state dependence of relaxation dynamics to develop a coherent picture of glassiness in various limits of the XXZ model on the kagome lattice.  ...  The ice manifold fragments into four topological sectors, shown as four connected components in the graph. The color of a vertex indicates the connected component it belongs to.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.01936v1">arXiv:2011.01936v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pjcefyovaveanoruukbspkn2vq">fatcat:pjcefyovaveanoruukbspkn2vq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210620022209/https://arxiv.org/pdf/2011.01936v2.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/31/5e/315ec130329762df1f83fa1acbda123e7e40e4b3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.01936v1" 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>

Incremental List Coloring of Graphs, Parameterized by Conservation [chapter]

Sepp Hartung, Rolf Niedermeier
<span title="">2010</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;
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that each vertex has one  ...  Finally, we provide empirical findings for the practical relevance of our approach in terms of a very effective graph coloring heuristic.  ...  Furthermore, we are grateful to Johannes Uhlmann and Mathias Weller for their insightful comments concerning Theorem 5.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-13562-0_24">doi:10.1007/978-3-642-13562-0_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lidne5mj5bfkho5kvg7jag76k4">fatcat:lidne5mj5bfkho5kvg7jag76k4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401013236/http://theinf1.informatik.uni-jena.de/publications/inc-list-coloring-tamc10.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/13/aa/13aa7c45478c05032bff39a84a7d545a54d39c61.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-642-13562-0_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Towards an Automatic Ice Navigation Support System in the Arctic Sea

Xintao Liu, Shahram Sattar, Songnian Li
<span title="2016-03-14">2016</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fw2uac7a5jggbfgqwh2wqy7yxu" style="color: black;">ISPRS International Journal of Geo-Information</a> </i> &nbsp;
This work would promote the development of ice navigation support system and potentially enhance the safety of ice navigation in the Arctic sea.  ...  We generate Voronoi Diagrams for the obstacle areas and build a road network-like graph for connections in the sea.  ...  The authors also wish to thank the Canadian Ice Service Archive for the ice data used in this study and its staff for their comments received during CanICE project execution.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi5030036">doi:10.3390/ijgi5030036</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e7izaqaytrduzpgnb72uwahltm">fatcat:e7izaqaytrduzpgnb72uwahltm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180728071800/https://res.mdpi.com/def502008123c5a244f58a5862d625060d605a73a1d8e9c8377fff065462fa036056ae79f47ecdeebaa4319955c460fbe8a8be7de552c6fd0c8d3f5641d5aa067f2689ce4c4867a1e249c1eed91edde5f732e6b57644397bc82cbc8ee6300ea28b308831db5b3f88707cae368e0022e38b1a362ad298f2964fa9b0dacfc74f150a9448abf24e79?filename=&amp;attachment=1" 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/84/fb843c040176eafefdb7875f04fee4795f2a862f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/ijgi5030036"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Scheduling Constraints and Interference Graph Properties for Graph-based Interference Coordination in Cellular OFDMA Networks

Marc C. Necker
<span title="2009-01-31">2009</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s3esrazljvacznpncbsypxcxwy" style="color: black;">Journal on spesial topics in mobile networks and applications</a> </i> &nbsp;
In this paper, we trace the problem of IFCO back to the graph coloring problem and investigate the achievable resource utilization of the interference coordinated system.  ...  Finally, we study the tradeoff between fairness and the total system throughput.  ...  input, and Joe Culberson for his graph coloring tools.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11036-009-0155-8">doi:10.1007/s11036-009-0155-8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ulmgzsy6srh23lnndf6bikeare">fatcat:ulmgzsy6srh23lnndf6bikeare</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829204416/http://www.ikr.uni-stuttgart.de/Content/Publications/Archive/Ne_graphcoloring_36803.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/92/e5/92e5d0696c1961a4ce9ab000785d1f65fc13d3c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s11036-009-0155-8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Cluster algorithm for Monte Carlo simulations of spin ice

Hiromi Otsuka
<span title="2014-12-11">2014</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lqjgbsoa65gghi2p2esulcqqqm" style="color: black;">Physical Review B</a> </i> &nbsp;
We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation.  ...  Also, to demonstrate the efficiency, we calculate the spin and charge structure factors, and observe pinch points in a high-resolution color map.  ...  FIG. 3 . 3 (Color online) Color maps of spin and charge structure factors, S ⊥ (Q) and C(Q), at T =0.3 (the bottom), 1.0 (the middle), and 2.0 (the top).  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevb.90.220406">doi:10.1103/physrevb.90.220406</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y2ca4havafdo5arspkfhrdra4a">fatcat:y2ca4havafdo5arspkfhrdra4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831085429/https://arxiv.org/pdf/1411.3807v1.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/0c/6d/0c6dce85d0ced15a2a5e08c34f7189bd306c648b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevb.90.220406"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

Frustration-induced emergent Hilbert space fragmentation

Kyungmin Lee, Arijeet Pal, Hitesh J. Changlani
<span title="2021-06-15">2021</span> <i title="American Physical Society (APS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b7jx7xdhxncvtj2nb24xhplinq" style="color: black;">Physical review B</a> </i> &nbsp;
Focusing on the highly frustrated kagome lattice, we demonstrate these phenomena in the Balents-Fisher-Girvin Hamiltonian (easy-axis regime), and a three-coloring model (easy-plane regime), both with constrained  ...  We study their level statistics and relaxation dynamics to develop a coherent picture of fragmentation in various limits of the XXZ model on the kagome lattice.  ...  The number above a box indicates the number of sampled disorder configurations, and the dashed lines are fits to the disorder averaged ice with the form ice /J z = 1 − J ⊥ /J ⊥ c .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevb.103.235133">doi:10.1103/physrevb.103.235133</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mm2wjierg5bfrcykufm37dczum">fatcat:mm2wjierg5bfrcykufm37dczum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211123172012/https://discovery.ucl.ac.uk/id/eprint/10117346/7/Pal_PhysRevB.103.235133.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/9c/9e/9c9e8051dca60b82a5e677e5bcea6e4020a58625.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1103/physrevb.103.235133"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> aps.org </button> </a>

An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem

Yongquan Zhou, Hongqing Zheng, Jinzhao Wu
<span title="2013-03-01">2013</span> <i title="Deanship of Scientific Research"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/agc3mek4qngbdaeke6vf5iawfy" style="color: black;">Applied Mathematics &amp; Information Sciences</a> </i> &nbsp;
In this paper, we proposed an improved cuckoo search optimization (ICS) algorithm for solving planar graph coloring problem.  ...  The proposed improved cuckoo search optimization algorithm can solve the planar graph coloring problem using four-colors more efficiently and accurately.  ...  A of planar graph with n nodes V = v 1 , v 2 , · · · , v n can be indicated as the coloring sequence R = r 1 , r 2 , · · · , r n , where r x ∈ R(1 ≤ x ≤ n) and r x ∈ {0, 1, 2, 3} .  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12785/amis/070249">doi:10.12785/amis/070249</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/447m2queaffw5kxzecpvbygjza">fatcat:447m2queaffw5kxzecpvbygjza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809092859/http://naturalspublishing.com/files/published/n2ev57fdp627o3.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/f4/6f/f46f2061ecdd132c3668c17dc313017cc34cec18.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12785/amis/070249"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

An information-based neural approach to generic constraint satisfaction

Henrik Jönsson, Bo Söderberg
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/weoplee4x5anpi62cco5v4higa" style="color: black;">Artificial Intelligence</a> </i> &nbsp;
Implemented as an annealing algorithm, the method is numerically explored on a testbed of Graph Coloring problems.  ...  The performance is comparable to that of dedicated heuristics, and clearly superior to that of conventional mean-field annealing.  ...  Ohlsson and C. Peterson for stimulating discussions. This work was in part supported by the Swedish Foundation for Strategic Research.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0004-3702(02)00291-6">doi:10.1016/s0004-3702(02)00291-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x42fipv66bhwxbpl54sc5dwqna">fatcat:x42fipv66bhwxbpl54sc5dwqna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190323025155/https://core.ac.uk/download/pdf/82727040.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/70/99/70993ca8bb904cd88e3ac27e6c9b9d56cf922c08.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0004-3702(02)00291-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs

Lian Li, Jingling Xue, Jens Knoop
<span title="2010-12-01">2010</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3yu4mbaainhw5gol4yayc35pfe" style="color: black;">ACM Transactions on Embedded Computing Systems</a> </i> &nbsp;
As a result, array interference graphs often form a special class of superperfect graphs (known as comparability graphs) and their optimal interval colorings become efficiently solvable.  ...  Compared to a graph coloring algorithm and an optimal ILP algorithm (when it runs to completion), our algorithm achieves close-to-optimal results and is superior to graph coloring for the benchmarks tested  ...  Interval coloring is a generalisation of graph coloring to node weighted graphs.  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1880050.1880064">doi:10.1145/1880050.1880064</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dfesno4hrrd4pci6cyquhlikiu">fatcat:dfesno4hrrd4pci6cyquhlikiu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401061556/http://www.cse.unsw.edu.au/~jingling/papers/tecs10.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/d0/4d/d04dec5d765f7cdfc41b0d088ec432f465ec644c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1880050.1880064"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Inferring Probabilistic Contagion Models Over Networks Using Active Queries

Abhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
<span title="">2018</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6g37zvjwwrhv3dizi6ffue642m" style="color: black;">Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM &#39;18</a> </i> &nbsp;
The problem of inferring unknown parameters of a networked social system is of considerable practical importance.  ...  We present approximation algorithms that provide provably good estimates of edge probabilities.  ...  Let G(V , E) be a directed graph, E be a fan-out edge coloring of G with τ colors and ϵ, δ ∈ (0, 1).  ...
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3269206.3271790">doi:10.1145/3269206.3271790</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cikm/AdigaCKMRRS18.html">dblp:conf/cikm/AdigaCKMRRS18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lcm6xjtb6fdrpolf3gr26l6caq">fatcat:lcm6xjtb6fdrpolf3gr26l6caq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200516155208/https://dl.acm.org/doi/pdf/10.1145/3269206.3271790" 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/c6/62/c662d0318e4bfe68a7641b111fae3e6e6a098ae7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3269206.3271790"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 99,171 results