Results 161 to 170 of about 2,022 (201)
Some of the next articles are maybe not open access.
SIAM Review, 1970
Introduction. A graph G = {N, E} is taken to be a finite set of nodes N together with a set of distinct edges E which are unordered pairs of distinct nodes. A matching M of the graph is a subset of the edges E with the property that no two edges of M are incident at a node. A matching M is perfect if every node is incident to an edge of M.
openaire +1 more source
Introduction. A graph G = {N, E} is taken to be a finite set of nodes N together with a set of distinct edges E which are unordered pairs of distinct nodes. A matching M of the graph is a subset of the edges E with the property that no two edges of M are incident at a node. A matching M is perfect if every node is incident to an edge of M.
openaire +1 more source
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019
With the massive growth of online learning, there has been a decrease in students' face-to-face interactions, leading to rising feelings of isolation. This in turn contributes to several issues such as motivation loss, increased course attrition rates and poor learning experiences.
Tam Nguyen Thanh +3 more
openaire +1 more source
With the massive growth of online learning, there has been a decrease in students' face-to-face interactions, leading to rising feelings of isolation. This in turn contributes to several issues such as motivation loss, increased course attrition rates and poor learning experiences.
Tam Nguyen Thanh +3 more
openaire +1 more source
Graphs of Triangulations and Perfect Matchings
Graphs and Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael E. Houle +3 more
openaire +1 more source
Perfect Matching and Polymatroids
Cybernetics and Systems Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Communications of the ACM, 2011
SUPPLIERS TO the UK's offshore oil and gas sector have spent decades developing and testing solutions to deep water challenges. But despite the best efforts of some, the UK oil and gas supply chain has had minimal involvement in nearshore wind farms installations to date.
openaire +2 more sources
SUPPLIERS TO the UK's offshore oil and gas sector have spent decades developing and testing solutions to deep water challenges. But despite the best efforts of some, the UK oil and gas supply chain has had minimal involvement in nearshore wind farms installations to date.
openaire +2 more sources
On Graphs with a Unique Perfect Matching
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiumei Wang +2 more
openaire +1 more source
Matchings and Perfect Matchings
2009As a young branch of mathematics, Graph Theory has experienced the explosion growth as the same phenomenon that has been taking place in computing science and communication networking. In the mean time, there are many new terminologies and knowledge accumulated in the process. So there are often more than one names or notions defined for a same entity.
Qinglin Roger Yu, Guizhen Liu
openaire +1 more source
On an obstruction for perfect matchings
Combinatorica, 1984\textit{K. Steffens} [Can. J. Math. 29, 165-168 (1976; Zbl 0324.05122)] proved a necessary and sufficient condition for the existence of perfect matchings in countable graphs. He presented a substructure (called ''compressed set'') which obstructs perfect matchings in any graph, and proved that in the countable case this is the only possible ...
openaire +2 more sources
Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture
SIAM Journal on Discrete Mathematics, 2016We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when ...
openaire +2 more sources
EMS magazine, 2008
Their love felt so right, but what if their DNA was all wrong?
openaire +3 more sources
Their love felt so right, but what if their DNA was all wrong?
openaire +3 more sources