"Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results."

Rachid Saad (2024)

> Home

Details and statistics

DOI: 10.1007/S00373-023-02747-4

access: closed

type: Journal Article

metadata version: 2024-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Saad24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Saad24
Rachid Saad:
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results. Graphs Comb. 40(2): 25 (2024)

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.