X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1242) 1242
Conference Proceeding (591) 591
Publication (102) 102
Book Chapter (31) 31
Dissertation (25) 25
Book / eBook (7) 7
Magazine Article (6) 6
Government Document (2) 2
Paper (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
bipartite graph (762) 762
algorithms (343) 343
mathematics (343) 343
bipartite graphs (276) 276
mathematics, applied (268) 268
computer science (248) 248
matching (213) 213
graphs (205) 205
bipartite matching (190) 190
computer science, theory & methods (140) 140
engineering, electrical & electronic (132) 132
graph theory (131) 131
optimization (124) 124
analysis (108) 108
perfect matching (103) 103
bipartite graph matching (96) 96
computer science, information systems (91) 91
combinatorics (87) 87
mathematical analysis (82) 82
algorithm design and analysis (76) 76
algorithm (72) 72
resource management (72) 72
polynomials (69) 69
operations research & management science (68) 68
computer science, software engineering (62) 62
approximation algorithms (61) 61
studies (61) 61
telecommunications (61) 61
computer science, artificial intelligence (59) 59
networks (59) 59
perfect matchings (59) 59
computer science, interdisciplinary applications (58) 58
trees (57) 57
maximum matching (54) 54
matchings (53) 53
theory of computation (53) 53
graph matching (49) 49
mathematical models (49) 49
discrete mathematics and combinatorics (48) 48
computer science, hardware & architecture (47) 47
scheduling (47) 47
throughput (46) 46
research (45) 45
theoretical computer science (44) 44
usage (43) 43
artificial intelligence (41) 41
applied mathematics (40) 40
combinatorial analysis (37) 37
interference (37) 37
linear programming (37) 37
assignment problem (36) 36
complexity (35) 35
computational complexity (35) 35
switches (35) 35
complexity theory (34) 34
number (34) 34
resource allocation (34) 34
scheduling algorithm (34) 34
discrete mathematics (33) 33
graph (33) 33
algorithm analysis and problem complexity (32) 32
bipartite (32) 32
convex and discrete geometry (32) 32
mathematics, interdisciplinary applications (32) 32
computer simulation (31) 31
computation (30) 30
computational modeling (30) 30
recognition (30) 30
systems (30) 30
vectors (30) 30
combinatorial optimization (29) 29
engineering design (29) 29
graphentheorie (29) 29
mathematics, general (29) 29
heuristic algorithms (28) 28
optimal matching (28) 28
statistics & probability (28) 28
delay (27) 27
feature extraction (27) 27
index medicus (27) 27
routing (26) 26
approximation (25) 25
educational institutions (25) 25
humans (25) 25
integers (25) 25
mathematics of computing (25) 25
visualization (25) 25
mathematics - combinatorics (24) 24
relays (24) 24
signal to noise ratio (24) 24
databases (23) 23
hungarian algorithm (23) 23
methods (23) 23
parallel algorithms (23) 23
stability (23) 23
approximation methods (22) 22
graph algorithms (22) 22
hexagonal systems (22) 22
mathematical modeling and industrial mathematics (22) 22
assignment (21) 21
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (1789) 1789
Chinese (14) 14
Japanese (6) 6
Korean (5) 5
Turkish (2) 2
Croatian (1) 1
French (1) 1
Indonesian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


IEEE Transactions on Pattern Analysis and Machine Intelligence, ISSN 0162-8828, 12/2010, Volume 32, Issue 12, pp. 2205 - 2215
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2010, Volume 158, Issue 15, pp. 1676 - 1690
We introduce two interdiction problems involving matchings, one dealing with edge removals and the other dealing with vertex removals. Given is an undirected... 
Maximum matching | Interdiction | Bounded treewidth | Approximation algorithm | Complexity | MATHEMATICS, APPLIED | SHORTEST-PATH | NETWORK INTERDICTION | DELETION PROBLEMS | TREEWIDTH | ALGORITHM | BIPARTITE GRAPHS | Algorithms | Matching | Approximation | Tasks | Mathematical analysis | Graphs | Dealing | Rounding | Marketing
Journal Article
Pattern Recognition Letters, ISSN 0167-8655, 08/2014, Volume 45, pp. 244 - 250
•A sub-optimal algorithm is presented to compute the Graph Edit Distance.•It obtains exactly the same distance value than the Bipartite algorithm.•The... 
Munkres algorithm | Bipartite graph matching | Graph Edit Distance | RECOGNITION | DATABASE | ALGORITHM | SETS | ASSIGNMENT | DISTANCE MEASURE | EDIT DISTANCE | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | Algorithms
Journal Article
Journal of the ACM (JACM), ISSN 0004-5411, 09/2019, Volume 66, Issue 5, pp. 1 - 23
In the online bipartite matching problem with replacements, all the vertices on one side of the bipartition are given, and the vertices on the other side... 
Online algorithms | shortest augmenting path | bipartite graphs | load balancing | maximum matching | Matching | Greedy algorithms | Lower bounds | Operations research | Apexes | Upper bounds | Graph theory
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2007, Volume 37, Issue 4, pp. 1030 - 1045
We consider the problem of matching a set of applicants to a set of posts, where each applicant has a preference list, ranking a nonempty subset of posts in... 
Matchings | Bipartite graphs | One-sided preference lists | MATHEMATICS, APPLIED | bipartite graphs | COMPUTER SCIENCE, THEORY & METHODS | matchings | one-sided preference lists | HOUSE ALLOCATION PROBLEMS
Journal Article
Review of Economic Studies, ISSN 0034-6527, 2017, Volume 84, Issue 1, pp. 444 - 463
We study the manipulability of stable matching mechanisms. To quantify incentives to manipulate stable mechanisms, we consider markets with random cardinal... 
Stable matching mechanism | Two-sided matching | Large market | Random bipartite graph | STABILITY | COLLEGE ADMISSIONS | ECONOMICS | EFFICIENCY
Journal Article
Ecography, ISSN 0906-7590, 11/2018, Volume 41, Issue 11, pp. 1910 - 1919
Interactions between resource and consumer species are organized in ecological networks. Species interactions in these networks are influenced by the... 
bipartite network | resource and consumer specialization | avian frugivory | SEED-DISPERSAL | ENVIRONMENT RELATIONSHIPS | PREY | BODY-SIZE | PATTERNS | ECOLOGY | BIODIVERSITY CONSERVATION | BIRDS | FOREST
Journal Article
IEEE Transactions on Circuits and Systems for Video Technology, ISSN 1051-8215, 03/2017, Volume 27, Issue 3, pp. 499 - 512
Journal Article
by Sicuro and Gabriele
10/2016, 1st ed. 2017, Springer Theses, ISBN 9783319465760, 144
This thesis discusses the random Euclidean bipartite matching problem, i.e., the matching problem between two different sets of points randomly generated on... 
Physics | Mathematical physics | Mathematical Methods in Physics | Mathematical Physics | Complex Systems | Statistical Physics and Dynamical Systems | Matching theory | Bipartite graphs
eBook
Discrete Applied Mathematics, ISSN 0166-218X, 03/2019, Volume 257, pp. 342 - 349
We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable... 
Antimatroids | Bipartite graphs | Stable matchings | Weighted matchings | MATHEMATICS, APPLIED | Combinatorial analysis | Weight
Journal Article
Image and Vision Computing, ISSN 0262-8856, 2009, Volume 27, Issue 7, pp. 950 - 959
In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged as a powerful and flexible... 
Graph based representation | Graph edit distance | Bipartite graph matching | COMPUTER SCIENCE, SOFTWARE ENGINEERING | ALGORITHM | ASSIGNMENT | COMPUTER SCIENCE, THEORY & METHODS | OPTICS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2019, Volume 269, pp. 27 - 31
Let G be a simple graph. A set of pairwise disjoint edges is a matching of G. The matching polytope of G, denoted M(G), is the convex hull of the set of the... 
Graph isomorphism | Skeleton of matching polytope (SMP) | Planar and bipartite SMP-graphs | Hypercube | MATHEMATICS, APPLIED | Polytopes | Matching | Apexes | Isomorphism | Graphs | Questions | Graph theory | Hulls (structures) | Convexity
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 12/2015, Volume 247, Issue 3, pp. 745 - 754
•We introduce the Partitioning Min–Max Weighted Matching Problem (PMMWM).•PMMWM combines a maximum matching and a partitioning problem.•Applications arise in... 
Assignment | Maximum matching | Container transshipment | Bipartite graph | Partitioning | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Problem solving | Heuristic programming | Analysis
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2018, Volume 243, pp. 304 - 310
An induced matching is a matching where no two edges are connected by a third edge. Finding a maximum induced matching on graphs with maximum degree Δ, for... 
Maximum induced matching | Approximation algorithms | MATHEMATICS, APPLIED | MAXIMUM INDUCED MATCHINGS | APPROXIMABILITY | SIZE | SUBCUBIC GRAPHS | BIPARTITE GRAPHS | Algorithms
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 07/2019, Volume 15, Issue 3, pp. 1 - 15
We introduce a weighted version of the ranking algorithm by Karp et al. (STOC 1990), and we prove a competitive ratio of 0.6534 for the vertex-weighted online... 
Vertex weighted | randomized primal-dual | online bipartite matching | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS
Journal Article
IEEE Communications Magazine, ISSN 0163-6804, 10/2015, Volume 53, Issue 10, pp. 128 - 135
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 07/2015, Volume 268, pp. 644 - 656
The theory of matching energy of graphs since been proposed by Gutman and Wagner in 2012, has attracted more and more attention. It is denoted by B n,m, the... 
Coulson integral formula | Quasi-order | Matching energy | Bipartite unicyclic graphs
Journal Article
The American Statistician, ISSN 0003-1305, 02/2011, Volume 65, Issue 1, pp. 21 - 30
Matching is a powerful statistical tool in design and analysis. Conventional two-group, or bipartite, matching has been widely used in practice. However, its... 
Bipartite matching | CRAN | Propensity score | Observational studies | R package | Graphic design | Integers | Control groups | Algorithms | Statistical analysis | Computer software | Statistical Computing and Graphics | Design analysis | Dosage | Computational statistics | BIAS | STATISTICS & PROBABILITY | TIME | CARE | BALANCE | Distribution (Probability theory) | Research | Multivariate analysis
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2019, Volume 791, pp. 132 - 140
For a graph with an even number of vertices, the matching preclusion number is the minimum number of edges whose deletion results in a graph with no perfect... 
Matchings | Matching preclusion | Interconnection networks | Bipartite graphs | COMPUTER SCIENCE, THEORY & METHODS
Journal Article