What Is This?

This is an HTML+RDFa representation of metadata describing this Web-addressable resource.

Why Is This Important?

The property (attributes and values pairs) links on this page unveil a different kind of link, one which enables the following on HTTP networks such as the Web:

  1. Unambiguous identity for entities (aka. strong identifiers)
  2. Implicit binding of an entity and its metadata via strong identifiers
  3. Multiple metadata representations that enable a variety of presentations
  4. High precision Search and Find queries that simply use the metadata documents (by referencing entity URIs) as the query's Data Source Name

How Do I Discover Alternative Metadata Representations?

This document exposes metadata in the following formats: (X)HTML+RDFa, Turtle, N3, RDF/JSON, or RDF/XML. In the most basic form, you can simply view the (X)HTML source markup of this page, and go directly to the <head/> section which contains a <link/> tag with relationship and type properties for each format.

In addition, you can also explicitly request a desired metadata representation for a given resource via HTTP GET requests that use the entity's strong identifier as the call target.

How Can I Expose My Web Resources In This Manner?

Simply include the following in the <head/> section of your (static or dynamically generated) (X)HTML page:

<link rel="alternate" title="My Data in RDF Linked Data form"
type="application/rdf+xml"
href="http://linkeddata.uriburner.com/about/id/<this-page-URL>/>"

How Is This Related To The Linked Data Meme?

As stated above, the links in this page expose strong identifiers for its primary topic, secondary topics, attributes, and some values. These links, via implicit association, act as conduits to their metadata-bearing documents, in a variety formats.

[OpenLink Software]

About: Matching (graph theory) - Wikipedia

An Entity of Type : Thing, from Data Source : https://en.wikipedia.org/wiki/Bipartite_matching, within Data Space : dev.restore.ovi.cnr.it:8890

  • References
  • Referenced By
content

og:title
  • Matching (graph theory) - Wikipedia
og:type
  • website
Title
  • Matching (graph theory) - Wikipedia
links to
  • https://en.wikipedia.org/wiki/CiteSeerX_(identifier)
  • https://doi.org/10.1145%2F28869.28874
  • https://en.wikipedia.org/wiki/Special:BookSources/0-7167-1045-5
  • https://en.wikipedia.org/wiki/Edmonds%27s_matching_algorithm
  • https://en.wikipedia.org/wiki/Graph_theory
  • https://en.wikipedia.org/wiki/Vertex_(graph_theory)
  • https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
  • https://en.wikipedia.org/wiki/Skew-symmetric_matrix
  • https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing
  • https://en.wikipedia.org/wiki/Mathematical_chemistry
  • https://en.wikipedia.org/wiki/Double_bond
  • https://en.wikipedia.org/wiki/L%C3%A1szl%C3%B3_Lov%C3%A1sz
  • https://en.wikipedia.org/wiki/Combinatorial_optimization
  • https://en.wikipedia.org/wiki/Flow_network
  • https://en.wikipedia.org/wiki/Approximation_algorithm
  • https://en.wikipedia.org/wiki/Discrete_Applied_Mathematics
  • https://en.wikipedia.org/wiki/Vijay_Vazirani
  • https://wikimediafoundation.org/
  • https://donate.wikimedia.org/?wmf_sour..._campaign=en.wikipedia.org&uselang=en
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy
  • https://foundation.wikimedia.org/wiki/...uage/Policy:Universal_Code_of_Conduct
  • https://developer.wikimedia.org
  • https://stats.wikimedia.org/#/en.wikipedia.org
  • https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement
  • https://www.mediawiki.org/
  • https://en.wikipedia.org/wiki/ISBN_(identifier)
  • https://en.wikipedia.org/wiki/Doi_(identifier)
  • https://en.wikipedia.org/wiki/Help:Authority_control
  • https://en.wikipedia.org/wiki/S2CID_(identifier)
  • https://en.wikipedia.org/wiki/PMID_(identifier)
  • https://en.wikipedia.org/wiki/Chinese_postman_problem
  • https://en.wikipedia.org/wiki/Chemical_structure
  • https://en.wikipedia.org/wiki/Thomas_H._Cormen
  • https://en.wikipedia.org/wiki/Randomized_algorithm
  • https://en.wikipedia.org/wiki/Computational_chemistry
  • https://en.wikipedia.org/wiki/Aromaticity
  • https://en.wikipedia.org/wiki/Odd_number
  • https://en.wikipedia.org/wiki/Main_Page
  • https://en.wikipedia.org/wiki/Wikipedia:Contents
  • https://en.wikipedia.org/wiki/Portal:Current_events
  • https://en.wikipedia.org/wiki/Special:Random
  • https://en.wikipedia.org/wiki/Wikipedia:About
  • https://en.wikipedia.org/wiki/Wikipedia:Contact_us
  • https://en.wikipedia.org/wiki/Help:Contents
  • https://en.wikipedia.org/wiki/Help:Introduction
  • https://en.wikipedia.org/wiki/Wikipedia:Community_portal
  • https://en.wikipedia.org/wiki/Special:RecentChanges
  • https://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard
  • https://en.wikipedia.org/wiki/Special:Search
  • https://en.wikipedia.org/wiki/Special:MyContributions
  • https://en.wikipedia.org/wiki/Special:MyTalk
  • https://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard
  • https://en.wikipedia.org/wiki/Special:SpecialPages
  • https://en.wikipedia.org/wiki/Category:CS1_maint:_multiple_names:_authors_list
  • https://en.wikipedia.org/wiki/Help:Category
  • https://en.wikipedia.org/wiki/Category:Articles_with_short_description
  • https://en.wikipedia.org/wiki/Category:Short_description_matches_Wikidata
  • https://en.wikipedia.org/wiki/Wikipedi...-ShareAlike_4.0_International_License
  • https://en.wikipedia.org/wiki/Wikipedia:General_disclaimer
  • https://en.wikipedia.org/wiki/ArXiv_(identifier)
  • https://en.wikipedia.org/wiki/Bibcode_(identifier)
  • https://en.wikipedia.org/wiki/Template:Citation
  • https://en.wikipedia.org/wiki/Skeletal_formula
  • https://en.wikipedia.org/wiki/Leslie_Valiant
  • https://en.wikipedia.org/wiki/Richard_M._Karp
  • https://en.wikipedia.org/wiki/Andr%C3%A1s_Frank
  • https://en.wikipedia.org/wiki/Edge_covering_number
  • https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
  • https://www.wikimedia.org/
  • https://en.wikipedia.org/wiki/Greedy_algorithm
  • https://en.wikipedia.org/wiki/Theoretical_Computer_Science
  • https://en.wikipedia.org/wiki/Induced_subgraph
  • https://en.wikipedia.org/wiki/Journal_of_Computational_Biology
  • https://en.wikipedia.org/wiki/Skew-symmetric_graph
  • https://en.wikipedia.org/wiki/Bipartite_matching#bodyContent
  • https://en.wikipedia.org/wiki/Bipartite_matching#
  • https://en.wikipedia.org/wiki/Bipartite_matching#Definitions
  • https://en.wikipedia.org/wiki/Bipartite_matching#Properties
  • https://en.wikipedia.org/wiki/Bipartite_matching#Matching_polynomials
  • https://en.wikipedia.org/wiki/Bipartit...gorithms_and_computational_complexity
  • https://en.wikipedia.org/wiki/Bipartite_matching#Maximum-cardinality_matching
  • https://en.wikipedia.org/wiki/Bipartite_matching#Maximum-weight_matching
  • https://en.wikipedia.org/wiki/Bipartite_matching#Maximal_matchings
  • https://en.wikipedia.org/wiki/Bipartite_matching#Counting_problems
  • https://en.wikipedia.org/wiki/Bipartit...Finding_all_maximally_matchable_edges
  • https://en.wikipedia.org/wiki/Bipartite_matching#Online_bipartite_matching
  • https://en.wikipedia.org/wiki/Bipartite_matching#Characterizations
  • https://en.wikipedia.org/wiki/Bipartite_matching#Applications
  • https://en.wikipedia.org/wiki/Bipartite_matching#Matching_in_general_graphs
  • https://en.wikipedia.org/wiki/Bipartite_matching#Matching_in_bipartite_graphs
  • https://en.wikipedia.org/wiki/Bipartite_matching#See_also
  • https://en.wikipedia.org/wiki/Bipartite_matching#References
  • https://en.wikipedia.org/wiki/Bipartite_matching#Further_reading
  • https://en.wikipedia.org/wiki/Bipartite_matching#External_links
  • https://en.wikipedia.org/w/index.php?t...8graph_theory%29%23Bipartite_matching
  • https://en.wikipedia.org/w/index.php?t...8graph_theory%29%23Bipartite_matching
  • https://en.wikipedia.org/w/index.php?title=Bipartite_matching&redirect=no
  • https://en.wikipedia.org/wiki/Bipartit...e_note-NetworkX_2.8.2_documentation-1
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-2
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-3
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-4
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-5
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-6
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-Fredman87-7
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-8
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-9
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-10
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-11
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-12
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-13
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-14
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-15
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-16
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-17
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-18
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-19
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_note-20
  • https://en.wikipedia.org/wiki/Bipartit..._ref-NetworkX_2.8.2_documentation_1-0
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-2
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-3
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-4
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-5
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-6
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-Fredman87_7-0
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-8
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-9
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-10
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-11
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-12
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-13
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-14
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-15
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-16
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-17
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-18
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-19
  • https://en.wikipedia.org/wiki/Bipartite_matching#cite_ref-20
  • https://en.wikipedia.org/w/index.php?t...)&oldid=1281190544#Bipartite_matching
  • https://en.m.wikipedia.org/w/index.php...toggle_view_mobile#Bipartite_matching
  • https://en.wikipedia.org/wiki/Journal_of_Algorithms
  • https://en.wikipedia.org/wiki/Shortest_path
  • https://en.wikipedia.org/wiki/Matching_(graph_theory)
  • https://en.wikipedia.org/wiki/Benzene
  • https://en.wikipedia.org/wiki/MR_(identifier)
  • https://en.wikipedia.org/wiki/Eigenvalues
  • https://en.wikipedia.org/wiki/Imaginary_number
  • https://en.wikipedia.org/wiki/Sharp-P-complete
  • https://en.wikipedia.org/wiki/Linear_programming#Covering/packing_dualities
  • https://en.wikipedia.org/wiki/Covering_problems
  • https://en.wikipedia.org/wiki/Packing_problems
  • https://en.wikipedia.org/wiki/Set_packing
  • https://en.wikipedia.org/wiki/Edge_cover
  • https://en.wikipedia.org/wiki/Vertex_cover
  • https://en.wikipedia.org/wiki/Independent_set_(graph_theory)
  • https://en.wikipedia.org/wiki/Bin_covering_problem
  • https://en.wikipedia.org/wiki/Polygon_covering
  • https://en.wikipedia.org/wiki/Rectangle_packing
  • https://en.wikipedia.org/wiki/Template:Covering/packing-problem_pairs
  • https://en.wikipedia.org/wiki/Template_talk:Covering/packing-problem_pairs
  • https://en.wikipedia.org/wiki/Special:...mplate:Covering/packing-problem_pairs
  • https://en.wikipedia.org/wiki/Michael_R._Garey
  • https://en.wikipedia.org/wiki/David_S._Johnson
  • https://en.wikipedia.org/wiki/Computer...uide_to_the_Theory_of_NP-Completeness
  • https://en.wikipedia.org/wiki/Journal_of_the_ACM
  • https://en.wikipedia.org/wiki/Hosoya_index
  • https://en.wikipedia.org/wiki/Polynomial_time
  • https://en.wikipedia.org/wiki/NP-complete
  • https://en.wikipedia.org/wiki/NP-hard
  • https://en.wikipedia.org/wiki/Adjacency_matrix
  • https://en.wikipedia.org/wiki/Biadjacency_matrix
  • https://en.wikipedia.org/wiki/Double_factorial
  • https://en.wikipedia.org/wiki/Online_algorithm
  • https://en.wikipedia.org/wiki/Assignment_problem
  • https://en.wikipedia.org/wiki/Edge_coloring
  • https://en.wikipedia.org/wiki/Planar_graph
  • https://en.wikipedia.org/wiki/Complete_graph
  • https://en.wikipedia.org/wiki/Incidence_(geometry)
  • https://en.wikipedia.org/wiki/Bipartite_graph
  • https://en.wikipedia.org/wiki/Generating_function
  • https://en.wikipedia.org/wiki/Edge_(graph_theory)
  • https://en.wikipedia.org/wiki/Loop_(graph_theory)
  • https://en.wikipedia.org/wiki/Weighted_graph
  • https://api.semanticscholar.org/CorpusID:7904683
  • https://en.wikipedia.org/wiki/Telephone_number_(mathematics)
  • https://en.wikipedia.org/wiki/Friedrich_August_Kekul%C3%A9_von_Stradonitz
  • https://en.wikipedia.org/wiki/Permanent_(mathematics)
  • https://en.wikipedia.org/wiki/Category:Combinatorial_optimization
  • https://en.wikipedia.org/wiki/Bin_packing_problem
  • https://en.wikipedia.org/wiki/Set_cover_problem
  • https://en.wikipedia.org/wiki/Marek_Karpinski
  • https://en.wikipedia.org/wiki/Introduction_to_Algorithms
  • https://en.wikipedia.org/wiki/Stable_marriage_problem
  • https://en.wikipedia.org/wiki/Dijkstra_algorithm
  • https://en.wikipedia.org/wiki/Hall%27s_marriage_theorem
  • https://en.wikipedia.org/wiki/Category:Matching_(graph_theory)
  • https://en.wikipedia.org/wiki/FKT_algorithm
  • https://en.wikipedia.org/wiki/Subgraph_isomorphism_problem
  • https://en.wikipedia.org/wiki/Charles_E._Leiserson
  • https://en.wikipedia.org/wiki/Ronald_L._Rivest
  • https://en.wikipedia.org/wiki/Clifford_Stein
  • https://en.wikipedia.org/wiki/Tutte_theorem
  • https://en.wikipedia.org/wiki/Perfect_matching
  • https://fr.wikipedia.org/wiki/Couplage_(th%C3%A9orie_des_graphes)
  • https://en.wikipedia.org/wiki/Induced_matching
  • https://en.wikipedia.org/wiki/Fibonacci_heap
  • https://en.wikipedia.org/wiki/Umesh_Vazirani
  • https://en.wikipedia.org/wiki/Matching_in_hypergraphs
  • https://en.wikipedia.org/wiki/K%C5%91nig%27s_theorem_(graph_theory)
  • https://en.wikipedia.org/wiki/Maximum_independent_set
  • https://en.wikipedia.org/wiki/Michael_D._Plummer
  • https://en.wikipedia.org/wiki/Category:Computational_problems_in_graph_theory
  • https://en.wikipedia.org/wiki/Factor-critical_graph
  • https://en.wikipedia.org/wiki/Special:BookSources/0-262-53196-8
  • https://doi.org/10.1016/j.laa.2016.02.004
  • https://arxiv.org/abs/0906.1317
  • https://ui.adsabs.harvard.edu/abs/2009arXiv0906.1317C
  • https://en.wikipedia.org/wiki/Dulmage%E2%80%93Mendelsohn_decomposition
  • https://en.wikipedia.org/wiki/Graph_matching
  • https://en.wikipedia.org/w/index.php?t...&returnto=Matching+%28graph+theory%29
  • https://en.wikipedia.org/w/index.php?t...&returnto=Matching+%28graph+theory%29
  • https://ar.wikipedia.org/wiki/%D8%A7%D...%D8%A8%D9%8A%D8%A7%D9%86%D9%8A%D8%A9)
  • https://ca.wikipedia.org/wiki/Aparellament_(teoria_de_grafs)
  • https://cs.wikipedia.org/wiki/P%C3%A1rov%C3%A1n%C3%AD_grafu
  • https://cy.wikipedia.org/wiki/Cydweddiad_(damcaniaeth_graffiau)
  • https://de.wikipedia.org/wiki/Matching_(Graphentheorie)
  • https://es.wikipedia.org/wiki/Apareamiento_(teor%C3%ADa_de_grafos)
  • https://eu.wikipedia.org/wiki/Parekatze_(grafo_teoria)
  • https://fa.wikipedia.org/wiki/%D8%AA%D...8%A8%D9%82_(%DA%AF%D8%B1%D8%A7%D9%81)
  • https://ko.wikipedia.org/wiki/%EB%B6%8...EB%9E%98%ED%94%84_%EC%9D%B4%EB%A1%A0)
  • https://it.wikipedia.org/wiki/Accoppiamento_(teoria_dei_grafi)
  • https://he.wikipedia.org/wiki/%D7%A9%D...%D7%94%D7%92%D7%A8%D7%A4%D7%99%D7%9D)
  • https://hu.wikipedia.org/wiki/P%C3%A1ros%C3%ADt%C3%A1s
  • https://nl.wikipedia.org/wiki/Koppeling_(grafentheorie)
  • https://ja.wikipedia.org/wiki/%E3%83%9...%E3%83%A9%E3%83%95%E7%90%86%E8%AB%96)
  • https://pl.wikipedia.org/wiki/Skojarzenie_(teoria_graf%C3%B3w)
  • https://pt.wikipedia.org/wiki/Acoplamento_(teoria_dos_grafos)
  • https://ru.wikipedia.org/wiki/%D0%9F%D...7%D0%B5%D1%82%D0%B0%D0%BD%D0%B8%D0%B5
  • https://sv.wikipedia.org/wiki/Matchning
  • https://uk.wikipedia.org/wiki/%D0%9F%D...%D0%B3%D1%80%D0%B0%D1%84%D1%96%D0%B2)
  • https://zh.wikipedia.org/wiki/%E5%8C%B9%E9%85%8D_(%E5%9B%BE%E8%AE%BA)
  • https://www.wikidata.org/wiki/Special:EntityPage/Q1065144#sitelinks-wikipedia
  • https://en.wikipedia.org/wiki/Talk:Matching_(graph_theory)
  • https://en.wikipedia.org/w/index.php?title=Matching_(graph_theory)&action=edit
  • https://en.wikipedia.org/w/index.php?t...atching_(graph_theory)&action=history
  • https://en.wikipedia.org/wiki/Special:WhatLinksHere/Matching_(graph_theory)
  • https://en.wikipedia.org/wiki/Special:...ChangesLinked/Matching_(graph_theory)
  • https://en.wikipedia.org/w/index.php?t...ching_(graph_theory)&oldid=1281190544
  • https://en.wikipedia.org/w/index.php?title=Matching_(graph_theory)&action=info
  • https://en.wikipedia.org/w/index.php?t...1281190544&wpFormIdentifier=titleform
  • https://en.wikipedia.org/w/index.php?t...theory%29&action=show-download-screen
  • https://en.wikipedia.org/w/index.php?title=Matching_(graph_theory)&printable=yes
  • https://commons.wikimedia.org/wiki/Category:Matching_(graph_theory)
  • https://www.wikidata.org/wiki/Special:EntityPage/Q1065144
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=1
  • https://en.wikipedia.org/wiki/Non-adjacent
  • https://en.wikipedia.org/wiki/Berge%27s_lemma
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=2
  • https://en.wikipedia.org/wiki/Matching_number
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=3
  • https://en.wikipedia.org/wiki/Matching_polynomial
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=4
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=5
  • https://en.wikipedia.org/wiki/Maximum_cardinality_matching
  • https://en.wikipedia.org/wiki/Hopcroft-Karp_algorithm
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=6
  • https://en.wikipedia.org/wiki/Maximum_weight_matching
  • https://en.wikipedia.org/wiki/Hungarian_algorithm
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=7
  • https://en.wikipedia.org/wiki/Edge_dominating_set
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=8
  • https://en.wikipedia.org/wiki/Hafnian
  • https://en.wikipedia.org/w/index.php?t..._(graph_theory)&action=edit§ion=9
  • https://en.wikipedia.org/wiki/Maximally_matchable_edge
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=10
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=11
  • https://en.wikipedia.org/w/index.php?t...vertex_biclique&action=edit&redlink=1
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=12
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=13
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=14
  • http://community.topcoder.com/stat?c=problem_statement&pm=2852&rd=5075
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=15
  • https://en.wikipedia.org/wiki/Fractional_matching
  • https://en.wikipedia.org/wiki/Matching_preclusion
  • https://en.wikipedia.org/wiki/Rainbow_matching
  • https://en.wikipedia.org/wiki/Stable_matching
  • https://en.wikipedia.org/wiki/Independent_vertex_set
  • https://en.wikipedia.org/w/index.php?t...(graph_theory)&action=edit§ion=16
  • https://networkx.org/documentation/sta...workx.algorithms.matching.is_matching
  • https://doi.org/10.1016%2F0166-218X%2892%2990275-F
  • https://mathscinet.ams.org/mathscinet-getitem?mr=1011265
  • https://arxiv.org/abs/1602.03590
  • http://cgi.di.uoa.gr/~vassilis/co/dominating-sets.pdf
  • https://doi.org/10.1137%2F0138030
  • https://www.csc.kth.se/~viggo/wwwcompendium/node13.html
  • https://www.csc.kth.se/~viggo/wwwcompendium/node21.html
  • https://www.csc.kth.se/~viggo/wwwcompendium/
  • https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.687
xhv:alternate
  • http://dev.restore.ovi.cnr.it:8890/abo...title=Special:RecentChanges&feed=atom
  • https://en.wikipedia.org/w/index.php?title=Special:RecentChanges&feed=atom
  • http://dev.restore.ovi.cnr.it:8890/abo...ing_(graph_theory)#Bipartite_matching
  • https://en.m.wikipedia.org/wiki/Matching_(graph_theory)#Bipartite_matching
  • http://dev.restore.ovi.cnr.it:8890/abo...e=Matching_(graph_theory)&action=edit
  • https://en.wikipedia.org/w/index.php?title=Matching_(graph_theory)&action=edit
xhv:icon
xhv:license
  • Deed - Attribution-ShareAlike 4.0 International - Creative Commons
xhv:stylesheet
  • http://dev.restore.ovi.cnr.it:8890/abo...e.styles&only=styles&skin=vector-2022
  • http://dev.restore.ovi.cnr.it:8890/abo...ent.init&only=styles&skin=vector-2022
mw:PageProp/toc
primary topic
  • https://en.wikipedia.org/wiki/Bipartite_matching
Alternative Linked Data Views: Facets | iSPARQL | ODE     Raw Linked Data formats: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD
This material is Open Knowledge   W3C Semantic Web Technology     This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3231, on Linux (x86_64-generic_glibc25-linux-gnu), Single Edition