Relevant bibliographies by topics / Maximum cardinality

Contents

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

Academic literature on the topic 'Maximum cardinality'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 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 'Maximum cardinality.'

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 "Maximum cardinality"

1

Brass, Peter. "On finding maximum-cardinality symmetric subsets." Computational Geometry 24, no. 1 (2003): 19–25. http://dx.doi.org/10.1016/s0925-7721(02)00046-9.

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

Costa, Marie-Christine. "Persistency in maximum cardinality bipartite matchings." Operations Research Letters 15, no. 3 (1994): 143–49. http://dx.doi.org/10.1016/0167-6377(94)90049-3.

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

Mahdavi Pajouh, F., and B. Balasundaram. "On inclusionwise maximal and maximum cardinality k-clubs in graphs." Discrete Optimization 9, no. 2 (2012): 84–97. http://dx.doi.org/10.1016/j.disopt.2012.02.002.

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

Klavžar, Sandi, Khaled Salem, and Andrej Taranenko. "Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems." Computers & Mathematics with Applications 59, no. 1 (2010): 506–13. http://dx.doi.org/10.1016/j.camwa.2009.06.011.

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

Pettie, S. "A simple reduction from maximum weight matching to maximum cardinality matching." Information Processing Letters 112, no. 23 (2012): 893–98. http://dx.doi.org/10.1016/j.ipl.2012.08.010.

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

Gabow, Harold N. "The Weighted Matching Approach to Maximum Cardinality Matching." Fundamenta Informaticae 154, no. 1-4 (2017): 109–30. http://dx.doi.org/10.3233/fi-2017-1555.

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

Hartvigsen, David, and Yanjun Li. "Maximum Cardinality Simple 2-matchings in Subcubic Graphs." SIAM Journal on Optimization 21, no. 3 (2011): 1027–45. http://dx.doi.org/10.1137/090760416.

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

Neethi, K. S., and Sanjeev Saxena. "Maximum cardinality neighbourly sets in quadrilateral free graphs." Journal of Combinatorial Optimization 33, no. 2 (2015): 422–44. http://dx.doi.org/10.1007/s10878-015-9972-9.

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

COCKAYNE, E. J., and C. M. MYNHARDT. "Irredundance and Maximum Degree in Graphs." Combinatorics, Probability and Computing 6, no. 2 (1997): 153–57. http://dx.doi.org/10.1017/s0963548396002891.

Full text
Abstract:
It is proved that the smallest cardinality among the maximal irredundant sets in an n–vertex graph with maximum degree Δ([ges ]2) is at least 2n/3Δ. This substantially improves a bound by Bollobás and Cockayne [1]. The class of graphs which attain this bound is characterised.
APA, Harvard, Vancouver, ISO, and other styles
10

Bodlaender, Hans L., and Arie M. C. A. Koster. "On the maximum cardinality search lower bound for treewidth." Discrete Applied Mathematics 155, no. 11 (2007): 1348–72. http://dx.doi.org/10.1016/j.dam.2007.02.004.

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

Dissertations / Theses on the topic "Maximum cardinality"

1

Asathulla, Mudabir Kabir. "A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/88080.

Full text
Abstract:
Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n^{6/5} log^2 {n}) where n is the number of vertices in the graph, bettering the O(n^{3/2}) time achieved independently by Hopcroft-Karp algorithm and by Lipton and
APA, Harvard, Vancouver, ISO, and other styles
2

Cosma, Ioana Ada. "Dimension reduction of streaming data via random projections." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc.

Full text
Abstract:
A data stream is a transiently observed sequence of data elements that arrive unordered, with repetitions, and at very high rate of transmission. Examples include Internet traffic data, networks of banking and credit transactions, and radar derived meteorological data. Computer science and engineering communities have developed randomised, probabilistic algorithms to estimate statistics of interest over streaming data on the fly, with small computational complexity and storage requirements, by constructing low dimensional representations of the stream known as data sketches. This thesis combin
APA, Harvard, Vancouver, ISO, and other styles
3

Rix, James Gregory. "Hypercube coloring and the structure of binary codes." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2809.

Full text
Abstract:
A coloring of a graph is an assignment of colors to its vertices so that no two adjacent vertices are given the same color. The chromatic number of a graph is the least number of colors needed to color all of its vertices. Graph coloring problems can be applied to many real world applications, such as scheduling and register allocation. Computationally, the decision problem of whether a general graph is m-colorable is NP-complete for m ≥ 3. The graph studied in this thesis is a well-known combinatorial object, the k-dimensional hypercube, Qk. The hypercube itself is 2-colorable for all k; how
APA, Harvard, Vancouver, ISO, and other styles
4

"Finding maximal benefit/maximal cardinality assignments." Massachusetts Institute of Technology, Laboratory for Information and Decision Systems], 1992. http://hdl.handle.net/1721.1/3286.

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

Book chapters on the topic "Maximum cardinality"

1

McDermid, Eric. "Maximum Cardinality Stable Matchings." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_677.

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

McDermid, Eric. "Maximum Cardinality Stable Matchings." In Encyclopedia of Algorithms. Springer US, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_677-1.

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

McDermid, Eric. "Maximum Cardinality Stable Matchings." In Encyclopedia of Algorithms. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_677-2.

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

Brass, Peter. "On Finding Maximum-Cardinality Symmetric Subsets." In Discrete and Computational Geometry. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-47738-1_8.

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

Berry, Anne, Jean R. S. Blair, and Pinar Heggernes. "Maximum Cardinality Search for Computing Minimal Triangulations." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36379-3_1.

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

Kutsch, Marcel, Peter J. Haas, Volker Markl, Nimrod Megiddo, and Tam Minh Tran. "Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11687238_67.

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

Mannino, Carlo, and A. Sassano. "Edge projection and the maximum cardinality stable set problem." In Cliques, Coloring, and Satisfiability. American Mathematical Society, 1996. http://dx.doi.org/10.1090/dimacs/026/11.

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

Crocker, Steven. "An experimental comparison of two maximum cardinality matching programs." In DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993. http://dx.doi.org/10.1090/dimacs/012/20.

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

Deveci, Mehmet, Kamer Kaya, Bora Uçar, and Ümit V. Çatalyürek. "GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs." In Euro-Par 2013 Parallel Processing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40047-6_84.

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

Bodlaender, Hans L., and Arie M. C. A. Koster. "On the Maximum Cardinality Search Lower Bound for Treewidth." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30559-0_7.

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

Conference papers on the topic "Maximum cardinality"

1

Martins, Ruben, Vasco Manquinho, and Inês Lynce. "Exploiting Cardinality Encodings in Parallel Maximum Satisfiability." In 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2011. http://dx.doi.org/10.1109/ictai.2011.54.

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

Giel, Oliver, and Ingo Wegenerraise. "Maximum cardinality matchings on trees by randomized local search." In the 8th annual conference. ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144095.

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

Kavitha, Telikepalli. "Popularity vs Maximum cardinality in the stable marriage setting." 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.11.

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

Azad, Ariful, and Aydin Buluc. "Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs." In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2016. http://dx.doi.org/10.1109/ipdps.2016.103.

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

Nguyen, Chuyen T., Kazunori Hayashi, Megumi Kaneko, and Hideaki Sakai. "Maximum a posteriori approach for anonymous RFID tag cardinality estimation." In ICASSP 2012 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2012. http://dx.doi.org/10.1109/icassp.2012.6288217.

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

Ignatiev, Alexey, Antonio Morgado, and Joao Marques-Silva. "Cardinality Encodings for Graph Optimization Problems." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/91.

Full text
Abstract:
Different optimization problems defined on graphs find application in complex network analysis. Existing propositional encodings render impractical the use of propositional satisfiability (SAT) and maximum satisfiability (MaxSAT) solvers for solving a variety of these problems on large graphs. This paper has two main contributions. First, the paper identifies sources of inefficiency in existing encodings for different optimization problems in graphs. Second, for the concrete case of the maximum clique problem, the paper develops a novel encoding which is shown to be far more compact than exist
APA, Harvard, Vancouver, ISO, and other styles
7

Deveci, Mehmet, Kamer Kaya, Bora Ucar, and Umit V. Catalyurek. "A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs." In 2013 42nd International Conference on Parallel Processing (ICPP). IEEE, 2013. http://dx.doi.org/10.1109/icpp.2013.11.

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

Azad, Ariful, Aydin Buluc, and Alex Pothen. "A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs." In 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2015. http://dx.doi.org/10.1109/ipdps.2015.68.

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

Lei, Zhendong, Shaowei Cai, and Chuan Luo. "Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/159.

Full text
Abstract:
Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints. In this paper, we introduce Extended Conjunctive Normal Form (ECNF), which expresses cardinality constraints straightforward and does not need auxiliary variables or clauses. Then, we develop a simple and efficient local search solver LS-ECNF with a well designed scoring function under ECNF. We also develop a generalized Unit Propagation (UP) based algorithm to gen
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Paul, Akshay Soni, Eun Yong Kang, Yajun Wang, and Mehul Parsana. "Diversity on the Go! Streaming Determinantal Point Processes under a Maximum Induced Cardinality Objective." In WWW '21: The Web Conference 2021. ACM, 2021. http://dx.doi.org/10.1145/3442381.3450089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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