Relevant bibliographies by topics / Perfekte Matchings

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Perfekte Matchings'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Perfekte Matchings.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Perfekte Matchings"

1

He, Jinghua, Erling Wei, Dong Ye, and Shaohui Zhai. "On perfect matchings in matching covered graphs." Journal of Graph Theory 90, no. 4 (2018): 535–46. http://dx.doi.org/10.1002/jgt.22411.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

LÜ, HUAZHONG, and TINGZENG WU. "Fractional Matching Preclusion for Restricted Hypercube-Like Graphs." Journal of Interconnection Networks 19, no. 03 (2019): 1940010. http://dx.doi.org/10.1142/s0219265919400103.

Full text
Abstract:
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion number of restricted hypercube-like graphs, whic
APA, Harvard, Vancouver, ISO, and other styles
3

CHENG, EDDIE, and SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES." Parallel Processing Letters 22, no. 02 (2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In thi
APA, Harvard, Vancouver, ISO, and other styles
4

MAO, YAPING, and EDDIE CHENG. "A Concise Survey of Matching Preclusion in Interconnection Networks." Journal of Interconnection Networks 19, no. 03 (2019): 1940006. http://dx.doi.org/10.1142/s0219265919400061.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.
APA, Harvard, Vancouver, ISO, and other styles
5

Ma, Tianlong, Yaping Mao, Eddie Cheng, and Jinling Wang. "Fractional Matching Preclusion for (n, k)-Star Graphs." Parallel Processing Letters 28, no. 04 (2018): 1850017. http://dx.doi.org/10.1142/s0129626418500172.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting
APA, Harvard, Vancouver, ISO, and other styles
6

CHENG, EDDIE, DAVID LU, and BRIAN XU. "STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS." Journal of Interconnection Networks 14, no. 02 (2013): 1350007. http://dx.doi.org/10.1142/s0219265913500072.

Full text
Abstract:
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. In this paper, we examine the properties of pancake graphs by finding its strong matching preclusion number and categorizing all optimal solutions.
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Shuangshuang, Yuzhi Xiao, Xia Liu, and Jun Yin. "A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs." Parallel Processing Letters 30, no. 01 (2020): 2050001. http://dx.doi.org/10.1142/s0129626420500012.

Full text
Abstract:
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure. In this paper, we obtain the strong matching preclusion number for a class of arrangement graphs and categorize their the strong matching preclusion set, which are a supplement of known results.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Xia, Tianlong Ma, Jun Yin, and Chengfu Ye. "Fractional matching preclusion for radix triangular mesh." Discrete Mathematics, Algorithms and Applications 11, no. 04 (2019): 1950048. http://dx.doi.org/10.1142/s1793830919500484.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong matching preclusion number (FSMP number) of [Formula: see text], denoted by
APA, Harvard, Vancouver, ISO, and other styles
9

Anantapantula, Sai, Christopher Melekian, and Eddie Cheng. "Matching Preclusion for the Shuffle-Cubes." Parallel Processing Letters 28, no. 03 (2018): 1850012. http://dx.doi.org/10.1142/s0129626418500123.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
APA, Harvard, Vancouver, ISO, and other styles
10

CHENG, EDDIE, RANDY JIA, and DAVID LU. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES." Journal of Interconnection Networks 11, no. 01n02 (2010): 35–60. http://dx.doi.org/10.1142/s0219265910002726.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In t
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Perfekte Matchings"

1

Hàn, Hiêp. "Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://dx.doi.org/10.18452/16402.

Full text
Abstract:
Einst als Hilfssatz für Szemerédis Theorem entwickelt, hat sich das Regularitätslemma in den vergangenen drei Jahrzehnten als eines der wichtigsten Werkzeuge der Graphentheorie etabliert. Im Wesentlichen hat das Lemma zum Inhalt, dass dichte Graphen durch eine konstante Anzahl quasizufälliger, bipartiter Graphen approximiert werden können, wodurch zwischen deterministischen und zufälligen Graphen eine Brücke geschlagen wird. Da letztere viel einfacher zu handhaben sind, stellt diese Verbindung oftmals eine wertvolle Zusatzinformation dar. Vom Regularitätslemma ausgehend gliedert sich
APA, Harvard, Vancouver, ISO, and other styles
2

Merschen, Julian. "Nash equilibria, gale strings, and perfect matchings." Thesis, London School of Economics and Political Science (University of London), 2011. http://etheses.lse.ac.uk/330/.

Full text
Abstract:
This thesis concerns the problem 2-NASH of finding a Nash equilibrium of a bimatrix game, for the special class of so-called “hard-to-solve” bimatrix games. The term “hardto-solve” relates to the exponential running time of the famous and often used Lemke– Howson algorithm for this class of games. The games are constructed with the help of dual cyclic polytopes, where the algorithm can be expressed combinatorially via labeled bitstrings defined by the “Gale evenness condition” that characterise the vertices of these polytopes. We define the combinatorial problem “Another completely labeled Gale s
APA, Harvard, Vancouver, ISO, and other styles
3

Eeckhout, Jan. "Perfect matching and search in economic models." Thesis, London School of Economics and Political Science (University of London), 1998. http://etheses.lse.ac.uk/2861/.

Full text
Abstract:
This thesis uses general matching techniques - both perfect matching and search - to study some problems in economies that are characterised by heterogeneity of their agents. Here, matching in its broadest sense is interpreted as a form of trade that is strictly limited between two partners: transactions are one-to-one, between one buyer and one seller exactly. The first part proposes a framework that integrates two well documented strands of the existing economic literature. It is a search model that generalises the frictionless perfect matching model to a context where trade does not occur i
APA, Harvard, Vancouver, ISO, and other styles
4

Kaštil, Jan. "Hledání regulárních výrazů s využitím technologie FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235986.

Full text
Abstract:
The thesis explains several algorithms for pattern matching. Algorithms work in both software and hardware. A part of the thesis is dedicated to extensions of finite automatons. The second part explains hashing and introduces concept of perfect hashing and CRC. The thesis also includes a suggestion of possible structure of a pattern matching unit based on deterministic finite automatons in FPGA. Experiments for determining the structure and size of resulting automatons were done in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
5

Dvořák, Milan. "Měření spolehlivosti vyhledávání vzorů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236542.

Full text
Abstract:
This thesis deals with the pattern matching methods based on finite automata and describes their optimizations. It presents a methodology for the measurement of reliability of pattern matching methods, by comparing their results to the results of the PCRE library. Experiments were conducted for a finite automaton with perfect hashing and faulty transition table. Finally, the resulting reliability evaluation of the algorithm is shown and possible solutions of the identified problems are proposed.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Chunyan. "Sample Size Analysis and Issues About No-Perfect Matched-Controls for Matched Case-Control Study." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1155578591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ferreira, Manuela Klanovicz. "Mapeamento estático de processos MPI com emparelhamento perfeito de custo máximo em cluster homogêneo de multi-cores." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2012. http://hdl.handle.net/10183/65636.

Full text
Abstract:
Um importante fator que precisa ser considerado para alcançar alto desempenho em aplicações paralelas é a distribuição dos processos nos núcleos do sistema, denominada mapeamento de processos. Mesmo o mapeamento estático de processos é um problema NP-difícil. Por esse motivo, são utilizadas heurísticas que dependem da aplicação e do hardware no qual a aplicação será mapeada. Nas arquiteturas atuais, além da possibilidade de haver mais de um processador por nó do cluster, é possível haver mais de um núcleo de processamento por processador, assim, o mapeamento estático de processos pode consider
APA, Harvard, Vancouver, ISO, and other styles
8

Bourgeois, Sophie. "The effects of matching learning strategies to learning modalities in the acquisition of the present perfect with adult ESL learners /." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82687.

Full text
Abstract:
Three adult ESL students in a private setting participated in this case study, which investigated the effects of teaching students through strategy instruction, to adopt learning strategies that matched their individual learning style. I designed the training to draw attention to 16 learning strategies, that learners could chose from, according to their VARK (visual, aural, read and write, kinesthetic) profile. Instruction was provided in the context of an intermediate level 1 class, for a weekly three hour class. The focus of the study was to gain knowledge of cognition, metacognition
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Xi. "Exploiting BioPortal as Background Knowledge in Ontology Alignment." Miami University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=miami1407331095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

See, Chan H. "Computation of electromagnetic fields in assemblages of biological cells using a modified finite difference time domain scheme. Computational electromagnetic methods using quasi-static approximate version of FDTD, modified Berenger absorbing boundary and Floquet periodic boundary conditions to investigate the phenomena in the interaction between EM fields and biological systems." Thesis, University of Bradford, 2007. http://hdl.handle.net/10454/4762.

Full text
Abstract:
yes<br>There is an increasing need for accurate models describing the electrical behaviour of individual biological cells exposed to electromagnetic fields. In this area of solving linear problem, the most frequently used technique for computing the EM field is the Finite-Difference Time-Domain (FDTD) method. When modelling objects that are small compared with the wavelength, for example biological cells at radio frequencies, the standard Finite-Difference Time-Domain (FDTD) method requires extremely small time-step sizes, which may lead to excessive computation times. The problem can be overc
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Perfekte Matchings"

1

Ruxton, Graeme D., William L. Allen, Thomas N. Sherratt, and Michael P. Speed. Synthesis. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199688678.003.0015.

Full text
Abstract:
In writing this new edition, we have thoroughly enjoyed exploring the most recent findings in the fascinating world of anti-predatory interactions and the diverse and sometimes astonishing related adaptations. The first section to this book was devoted to studies of crypsis, beginning with a consideration of background matching. Simply matching the background against which you are seen might seem at first pass to be the be all and end all of avoiding detection. The running theme throughout this chapter, however, is that costs and constraints mean that perfect background matching is often not o
APA, Harvard, Vancouver, ISO, and other styles
2

Markovs Theorem And 100 Years Of The Uniqueness Conjecture From Irrational Numbers To Perfect Matchings. Springer International Publishing AG, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Trescothik, Kate. Notebook: Perfect Match Funny Valentines Day Pun Couple Matching Gift Journal and Notebook for Girls and Boy Composition Size with Lined Pages Perfect for Journal Doodling Sketching and Notes for School. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stephens, Regina. Notebook Journal: OLeary Family Surname St Patricks Day Matching Quote Funny Lined 6x9 Notebook, Original Appreciation Cool ... ... for Her and Him, Perfect for Graduation. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

S, Peeratchaya. Unicorn Activity Books for Kids Ages 4-8: Perfect Enjoyable Games and Activities. Dot to Dot, Maze, Color by Number, Coloring, Pazzle, Matching and Many More. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Trescothik, Kate. Notebook: 28Th Years Wedding Anniversary Gifts for Couples Matching Journal and Notebook for Girls and Boy Composition Size with Lined Pages Perfect for Journal Doodling Sketching and Notes for School. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Trucks, Trucks. Sketchbook: Funny Red Plaid Grandma Bear Buffalo Matching Family Pajama Unlined 8. 5''x11'' White Paper Blank Sketchbook 111 Pages with Black Cover a Perfect Gift for Kid - Artists - Creative People and Students. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Trucks, Trucks. Sketchbook: 2Nd Birthday Boy Shark Matching Party Gifts for Kids Unlined 8. 5''x11'' White Paper Blank Sketchbook 111 Pages with Black Cover a Perfect Gift for Kid - Artists - Creative People and Students. Independently Published, 2020.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Perfekte Matchings"

1

Yu, Qinglin Roger, and Guizhen Liu. "Matchings and Perfect Matchings." In Graph Factors and Matching Extensions. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93952-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pe’er, Itsik, Ron Shamir, and Roded Sharan. "Incomplete Directed Perfect Phylogeny." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45123-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Habib, Michel, and Juraj Stacho. "Unique Perfect Phylogeny Is NP-Hard." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21458-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Matoušek, Jiří. "Perfect matchings and determinants." In The Student Mathematical Library. American Mathematical Society, 2010. http://dx.doi.org/10.1090/stml/053/24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Farach, Martin, and S. Muthukrishnan. "Perfect hashing for strings: Formalization and algorithms." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bouvel, Mathilde, Cedric Chauve, Marni Mishna, and Dominique Rossin. "Average-Case Analysis of Perfect Sorting by Reversals." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02441-2_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Barzuza, Tamar, Jacques S. Beckmann, Ron Shamir, and Itsik Pe’er. "Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Han, Jie, and Peter Keevash. "Finding Perfect Matchings in Dense Hypergraphs." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vukičević, Damir. "Applications of Perfect Matchings in Chemistry." In Structural Analysis of Complex Networks. Birkhäuser Boston, 2010. http://dx.doi.org/10.1007/978-0-8176-4789-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sachs, H. "Counting Perfect Matchings in Lattice Graphs." In Topics in Combinatorics and Graph Theory. Physica-Verlag HD, 1990. http://dx.doi.org/10.1007/978-3-642-46908-4_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Perfekte Matchings"

1

Herber, Daniel R., Tinghao Guo, and James T. Allison. "Enumeration of Architectures With Perfect Matchings." In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60212.

Full text
Abstract:
In this article a class of architecture design problems is explored with perfect matchings. A perfect matching in a graph is a set of edges such that every vertex is present in exactly one edge. The perfect matching approach has many desirable properties such as complete design space coverage. Improving on the pure perfect matching approach, a tree search algorithm is developed that more efficiently covers the same design space. The effect of specific network structure constraints and colored graph isomorphisms on the desired design space is demonstrated. This is accomplished by determining al
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Jingzhi, Bin Hu, Heping Zhang, Tingzhao Zhu, and Xiaowei Li. "Forbidden subgraph and perfect path-matchings." In 2009 1st IEEE Symposium on Web Society (SWS). IEEE, 2009. http://dx.doi.org/10.1109/sws.2009.5271774.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Annamalai, Chidambaram. "Finding Perfect Matchings in Bipartite Hypergraphs." In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Eppstein, David, and Vijay V. Vazirani. "NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs." In SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 2019. http://dx.doi.org/10.1145/3323165.3323206.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Crastes, M., K. Sakouti, and G. Saucier. "A technology mapping method based on perfect and semi-perfect matchings." In the 28th conference. ACM Press, 1991. http://dx.doi.org/10.1145/127601.127634.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Keevash, Peter, Fiachra Knox, and Richard Mycroft. "Polynomial-time perfect matchings in dense hypergraphs." In the 45th annual ACM symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2488608.2488647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Izumi, Taisuke, and Tadashi Wadayama. "A New Direction for Counting Perfect Matchings." In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2012. http://dx.doi.org/10.1109/focs.2012.28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Björklund, Andreas. "Counting Perfect Matchings as Fast as Ryser." In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973099.73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chaudhuri, K., C. Daskalakis, R. D. Kleinberg, and H. Lin. "Online Bipartite Perfect Matching With Augmentations." In 2009 Proceedings IEEE INFOCOM. IEEE, 2009. http://dx.doi.org/10.1109/infcom.2009.5062016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cygan, Marek, Stefan Kratsch, and Jesper Nederlof. "Fast hamiltonicity checking via bases of perfect matchings." In the 45th annual ACM symposium. ACM Press, 2013. http://dx.doi.org/10.1145/2488608.2488646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Perfekte Matchings' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography