Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Uniquely restricted matchings
M. C. Golumbic
, T. Hirst
, M. Lewenstein
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Uniquely restricted matchings'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Linear Time
100%
Interval Graph
100%
Bipartite Graph
100%
Edge
50%
Comparability Graph
50%
Matching Problem
50%
Block Graph
50%
Rank of a Matrix
50%
Perfect Matchings
50%
Keyphrases
Uniquely Restricted Matching
100%
Linear Time
33%
Bipartite Graph
33%
Split Graphs
33%
Threshold Graph
33%
Matching Problem
16%
Interval Graphs
16%
Special Class
16%
Chordal Graph
16%
NP-complete
16%
Comparability Graphs
16%
Graph Algorithms
16%
Cactus
16%
Perfect Matching
16%
Arbitrary Graphs
16%
Matrix Rank
16%
Complexity Results
16%
Block Graph
16%
Zero-nonzero Pattern
16%
Cactus Graph
16%
Proper Interval Graph
16%
Saturated Vertex
16%
Common Vertex
16%
Graph Classification
16%
PRESENT Algorithm
16%
Computer Science
Bipartite Graph
100%
Interval Graph
100%
Threshold Graph
100%
Subgraphs
50%
Complexity Result
50%
Perfect Matchings
50%
Chordal Graph
50%