Filters








196,220 Hits in 1.9 sec

Permuted function matching

Raphaël Clifford, Benjamin Sach
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
We consider the combination of function and permuted matching, each of which has fast solutions in their own right.  ...  We show that the problem of determining for each substring of the text, if any permutation of the pattern has a function match is in general NP-Complete.  ...  Definition 3 (Permuted Function/Parameterised Matching).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2010.08.017">doi:10.1016/j.ipl.2010.08.017</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fwzw325rw5b67pgvna3cncahru">fatcat:fwzw325rw5b67pgvna3cncahru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809083112/http://www.cs.bris.ac.uk/Publications/Papers/2001297.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/7a/3d/7a3df53ea0ac63b26808cba886314841a175fef4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2010.08.017"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A reciprocity approach to computing generating functions for permutations with no pattern matches

Miles Jones, Jeffrey Remmel, Miles Jones, Jeffrey Remmel
<span class="release-stage">unpublished</span>
σ∈N Mn(τ) x LRMin(σ) y 1+des(σ) where τ is a permutation that starts with 1, N Mn(τ) is the set of permutations in the symmetric group Sn with no τ-matches, and for any permutation σ ∈ Sn, LRMin(σ) is  ...  σ∈N Mn(τ) x LRMin(σ) y 1+des(σ) o' u τ est une permutation, N Mn(τ) est l'ensemble des permutations dans le groupe symétrique Sn sans τ-matches, et pour toute permutation σ ∈ Sn, LRMin(σ) est le nombre  ...  function of permutations that have no τ -matches.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xdr3h6rcqvdyvlpml6icepdahi">fatcat:xdr3h6rcqvdyvlpml6icepdahi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180521151353/https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/viewFile/dmAO0149/3602.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/d7/45/d74501c058eb014058f7a5ac14396b1668d2e779.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Permuted Pattern Matching Algorithms on Multi-Track Strings

Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara
<span title="2019-04-08">2019</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/63zsvf7vxzfznojpqgfvpyk2lu" style="color: black;">Algorithms</a> </i> &nbsp;
In this paper, we propose several algorithms for permuted pattern matching.  ...  Given the pattern and text of two multi-track strings, the permuted pattern matching problem is to find the occurrence positions of all permutations of the pattern in the text.  ...  Multi-Track Permuted Matching Automaton In this subsection, we describe a data structure called a multi-track permuted matching automaton that can perform permuted pattern matching on a multi-track text  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12040073">doi:10.3390/a12040073</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wwdsff5vurhanpe2fmm4dtgejy">fatcat:wwdsff5vurhanpe2fmm4dtgejy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502121928/https://res.mdpi.com/algorithms/algorithms-12-00073/article_deploy/algorithms-12-00073-v2.pdf?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/e1/eb/e1eb5a95996af146e68e59f9f1608442ab2a17ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/a12040073"> <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>

Fast Boolean matching under permutation using representative

D. Debnath, T. Sasao
<span title="">1999</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fkjmyf3l45eo5ovjdnpeqpdjd4" style="color: black;">Proceedings of the ASP-DAC &#39;99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)</a> </i> &nbsp;
This paper presents an efficient method to check the equivalence of two Boolean functions under permutation of the variables. The problem is also known as Boolean matching.  ...  As a basis of the Boolean matching, we use the notion P-representative. If two functions have the same P-representative then they match.  ...  INTRODUCTION Boolean matching is a technique to detect the equivalence of two Boolean functions under permutation of the variables.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/aspdac.1999.760033">doi:10.1109/aspdac.1999.760033</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/aspdac/DebnathS99.html">dblp:conf/aspdac/DebnathS99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pyfjyh467zcinherspm7yjxsre">fatcat:pyfjyh467zcinherspm7yjxsre</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030516070356/http://lsi-cad.com:80/sasao/Papers/files/aspdac1999_debnath.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/5b/37/5b3778d9c62cc772c27317afe353f68a32ec273d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/aspdac.1999.760033"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Exploiting symmetry in SAT-based boolean matching for heterogeneous FPGA technology mapping

Yu Hu, Victor Shih, Rupak Majumdar, Lei He
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tadj4kfdtfdjfhulrlnjm4vb4i" style="color: black;">Computer-Aided Design (ICCAD), IEEE International Conference on</a> </i> &nbsp;
In this paper we propose an efficient SAT-BM algorithm by exploring function and architectural symmetries.  ...  The Boolean matching problem is a key procedure in technology mapping for heterogeneous Field Programmable Gate Arrays (FPGA), and SAT-based Boolean matching (SAT-BM) provides a highly flexible solution  ...  Input Permutations An important issue in Boolean matching is input permutation, which allows different mappings from pins in a PLB to variables of a Boolean function.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccad.2007.4397289">doi:10.1109/iccad.2007.4397289</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iccad/HuSMH07.html">dblp:conf/iccad/HuSMH07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rb6o4j46gngnbczbltv7t7zzzm">fatcat:rb6o4j46gngnbczbltv7t7zzzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080425140010/http://www.ee.ucla.edu/~hu/pub/iccad07-satbm.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/23/f9/23f93fb67650de5bf0b2e431d8ed1cd7bdd89e97.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/iccad.2007.4397289"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs

Marie-Louise Bruner, Martin Lackner
<span title="2015-06-16">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhi3z76be5c5xeihac5cyiid3m" style="color: black;">Algorithmica</a> </i> &nbsp;
The NP-complete PERMUTATION PATTERN MATCHING problem asks whether a permutation P can be matched into a permutation T . A matching is an order-preserving embedding of P into T .  ...  PERMUTATION PATTERN MATCHING (PPM) Instance: A permutation T (the text) of length n and a permutation P (the pattern) of length k ≤ n. Question: Is there a matching of P into T ?  ...  Part 1: Matching Functions. We introduce the concept of matching functions. These are functions from [run(P )], i.e. runs in P , to sequences of adjacent runs in T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-015-0013-y">doi:10.1007/s00453-015-0013-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2ixgh4snsngl7pq2kdnea7ttti">fatcat:2ixgh4snsngl7pq2kdnea7ttti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808122219/http://www.dbai.tuwien.ac.at/staff/lackner/publications/swat2012.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/b7/9e/b79e4e2a3a4aad81c322ccd8978d6f53aee9a779.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-015-0013-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs [chapter]

Marie-Louise Bruner, Martin Lackner
<span title="">2012</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;
The NP-complete PERMUTATION PATTERN MATCHING problem asks whether a permutation P can be matched into a permutation T . A matching is an order-preserving embedding of P into T .  ...  PERMUTATION PATTERN MATCHING (PPM) Instance: A permutation T (the text) of length n and a permutation P (the pattern) of length k ≤ n. Question: Is there a matching of P into T ?  ...  Part 1: Matching Functions. We introduce the concept of matching functions. These are functions from [run(P )], i.e. runs in P , to sequences of adjacent runs in T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-31155-0_23">doi:10.1007/978-3-642-31155-0_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sqxths3razagpkx5ehlucsvr6m">fatcat:sqxths3razagpkx5ehlucsvr6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808122219/http://www.dbai.tuwien.ac.at/staff/lackner/publications/swat2012.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/b7/9e/b79e4e2a3a4aad81c322ccd8978d6f53aee9a779.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-31155-0_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Filtering Multi-set Tree: Data Structure for Flexible Matching Using Multi-track Data

Kazuyuki NARISAWA, Takashi KATSURA, Hiroyuki OTA, Ayumi SHINOHARA
<span title="">2015</span> <i title="Graduate School of Information Sciences, Tohoku University"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kwub3pqoxbcqrjctr4lrwwfvhu" style="color: black;">Interdisciplinary Information Sciences</a> </i> &nbsp;
The permuted pattern matching problem aims to determine the occurrences of multi-track patterns in multi-track text by allowing the order of the pattern tracks to be permuted.  ...  In this study, we address permuted pattern matching by proposing a new data structure called a filtering multi-set tree (FILM tree).  ...  Hash Functions By selecting suitable hash functions for the SBF, FILM trees can be adopted to solve various permuted pattern matching problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4036/iis.2015.37">doi:10.4036/iis.2015.37</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sbuftk2uorelpemoxz55i5rb7i">fatcat:sbuftk2uorelpemoxz55i5rb7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727110526/https://www.jstage.jst.go.jp/article/iis/21/1/21_IIS210104/_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/b1/90/b190f0f9c6c838155246e08696677b0798a55e38.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4036/iis.2015.37"> <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>

Boolean Mapping based on Testing Techniques [chapter]

Ricardo Ferreira, Anne-Marie Trullemans, Ricardo Jacobi
<span title="">1997</span> <i title="Springer US"> VLSI: Integrated Systems on Silicon </i> &nbsp;
The matching is detected by checking the controllability and observability of signals in the cell structure against the subject functions of the network.  ...  This paper presents a novel mapping technique, which uses a Boolean matching algorithm based on testing techniques.  ...  Match(function J, cell g,permutation II= initial permutation) (1) { if ( scanline{f,g,II) ==Found ) return match_found; (2) return Match{!  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35311-1_28">doi:10.1007/978-0-387-35311-1_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y3ry2suhpff4xcfqnmlvh2wx2u">fatcat:y3ry2suhpff4xcfqnmlvh2wx2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180729032921/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35311-1_28.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/78/9d/789d0ff3ac9e439438646241504dc2a5acb8d7f2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35311-1_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Ancilla-free Reversible Logic Synthesis via Sorting [article]

Anupam Chattopadhyay, Sharif Md Khairul Hossain
<span title="2016-05-26">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Fig. 6 : Circuit without partial matching for permutation (7, 5, 3, 1, 6, 4, 2, 0) Fig. 7 : Circuit with partial matching for permutation (7, 5, 3, 1, 6, 4, 2, 0) a • • • a b • • • • b c • • • • • c a  ...  Partial match and Output permutation provides much improvement over the naive algorithm. Due to unavailability of a definitive template-set, the template matching is not applied.  ...  Table 5 : Benchmark for 4-bit reversible functions against optimal gate count [24] Name Specification Optimal Circuit GC [24] RevCol GC Hybrid GC 4bit-7-8 0,1,2,3,4,5,6,8,7, 9,10,11,12,13,14,15  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.05989v2">arXiv:1605.05989v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ezyxo3ol5cwrd2sdsqdq3eawe">fatcat:7ezyxo3ol5cwrd2sdsqdq3eawe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826122202/https://arxiv.org/pdf/1605.05989v2.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/6f/f76f5bceeb7059e40661b77d9e5e604885c6312e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.05989v2" 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>

Cycle Slicer: An Algorithm for Building Permutations on Special Domains [chapter]

Sarah Miracle, Scott Yilek
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
If neither x or y is part of the matching M t then (x, y) ∈ GP t .  ...  Our analysis of Cycle Slicer uses a refinement of the Markov chain techniques for analyzing matching exchange processes, which were originally developed by Czumaj and Kutylowski (Rand.  ...  The basic idea underlying RCW is to use permutations on X to form matchings on X .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-70700-6_14">doi:10.1007/978-3-319-70700-6_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hoh72ufsivfyhknxnqgz2cagjq">fatcat:hoh72ufsivfyhknxnqgz2cagjq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304035122/http://pdfs.semanticscholar.org/b757/9bb9acc66dfe73848492780621dd8ad8d58e.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/b7/57/b7579bb9acc66dfe73848492780621dd8ad8d58e.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-319-70700-6_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Deep Set-to-Set Matching and Learning [article]

Yuki Saito, Takuma Nakamura, Hirotaka Hachiya, Kenji Fukumizu
<span title="2019-10-22">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
function.  ...  Matching two sets of items, called set-to-set matching problem, is being recently raised.  ...  For permutation invariance, because a composite function of a permutation equivariant function G and permutation invariant function CS or mCS (described in Property 1) is permutation invariant, both CS  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.09972v1">arXiv:1910.09972v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wn3jvmpbjzcprkmt2k4ql2gmnm">fatcat:wn3jvmpbjzcprkmt2k4ql2gmnm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200913110254/https://arxiv.org/pdf/1910.09972v1.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/0e/fb/0efb75cbfcdd43167f0cff4db1269147effb1461.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1910.09972v1" 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>

A dynamical systems approach to weighted graph matching

Michael M. Zavlanos, George J. Pappas
<span title="">2008</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/e5pgtxytlra45muqmfmoj6kvte" style="color: black;">Automatica</a> </i> &nbsp;
The combination of the two dynamical systems converges to a permutation matrix which, provides a suboptimal solution to the weighted graph matching problem.  ...  In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challenging due the combinatorial nature of the set of permutations.  ...  The graph matching problem consists of finding a permutation π ∈ S n such that, π = arg min π i,j a (1) π(i)π(j) − a (2) ij 2 We define a permutation matrix P as follows, Definition 2.1 (Permutation Matrix  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2008.04.009">doi:10.1016/j.automatica.2008.04.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cwcuquywfngu7nbz5l7vb7yody">fatcat:cwcuquywfngu7nbz5l7vb7yody</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070710040438/http://www.seas.upenn.edu:80/~zavlanos/publications/conference/ZP_CDC06.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/7d/97/7d97b300b2556aa9a753f544aa0221d1fa799dc8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.automatica.2008.04.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs [article]

Viet Dung Nguyen, Ba Thai Pham, Phan Thuan Do
<span title="2021-07-18">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We first design an 𝒪(n^2) solution for finding a maximum induced matching in permutation graphs given their permutation models, based on a dynamic programming algorithm with the aid of the sweep line  ...  Our results are far better than the best known 𝒪(mn) algorithm for the maximum induced matching problem in both graph classes, which was proposed by Habib et al.  ...  The length of the chain is k, and the match e 1 is the smallest match of the chain. 2 . 2 Calculate two functions f and link for all matches e. 3.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.08480v1">arXiv:2107.08480v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hgo2xid5rnh7vpqnxmhb3mptbm">fatcat:hgo2xid5rnh7vpqnxmhb3mptbm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210721150431/https://arxiv.org/pdf/2107.08480v1.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/d8/6f/d86f3742f50979ff5580924e256ebb1d03f4bc61.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2107.08480v1" 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>

A Dynamical Systems Approach to Weighted Graph Matching

Michael M. Zavlanos, George J. Pappas
<span title="">2006</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wjd7b2sxyfahnaei4xvi46vwsu" style="color: black;">Proceedings of the 45th IEEE Conference on Decision and Control</a> </i> &nbsp;
The combination of the two dynamical systems converges to a permutation matrix which, provides a suboptimal solution to the weighted graph matching problem.  ...  In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challenging due the combinatorial nature of the set of permutations.  ...  The graph matching problem consists of finding a permutation π ∈ S n such that, π = arg min π i,j a (1) π(i)π(j) − a (2) ij 2 We define a permutation matrix P as follows, Definition 2.1 (Permutation Matrix  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cdc.2006.377633">doi:10.1109/cdc.2006.377633</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/cdc/ZavlanosP06.html">dblp:conf/cdc/ZavlanosP06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4qwd6r2vrzgn5bgriawt7fab64">fatcat:4qwd6r2vrzgn5bgriawt7fab64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070710040438/http://www.seas.upenn.edu:80/~zavlanos/publications/conference/ZP_CDC06.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/7d/97/7d97b300b2556aa9a753f544aa0221d1fa799dc8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cdc.2006.377633"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 196,220 results