"Minimizing the Number of Edges in K(s, t)-Saturated Bipartite ..."

Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis (2021)

> Home

Details and statistics

DOI: 10.1137/20M1368835

access: closed

type: Journal Article

metadata version: 2021-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/ChakrabortiCH21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/ChakrabortiCH21
Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis:
Minimizing the Number of Edges in K_{(s, t)}-Saturated Bipartite Graphs. SIAM J. Discret. Math. 35(2): 1165-1181 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.