Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Linear-Time Algorithm to Find Four Independent Spanning Trees in ..."

Kazuyuki Miura et al. (1998)

> Home

Details and statistics

DOI: 10.1007/10692760_25

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/MiuraTNN98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/MiuraTNN98
Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki:
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG 1998: 310-323

a service of

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.