Finding Maximum Degrees in Hidden Bipartite Graphs

doi 10.1145/1807167.1807263
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Approximating Maximum Uniquely Restricted Matchings in Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Terminal-Pairability in Complete Bipartite Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

A Characterization of Weakly Bipartite Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

An Enhanced Genetic Algorithm Based Courses Timetabling Method for Maximal Enrollments Using Maximum Matching on Bipartite Graphs

Vietnam Journal of Science and Technology
2019English

Types of Degrees in Bipolar Fuzzy Graphs

Applied Mathematical Sciences
2013English

P_m-Saturated Bipartite Graphs With Minimum Size

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy