More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"The number of reachable pairs in a digraph."

A. R. Rao (2003)

> Home

Details and statistics

DOI: 10.1016/S1571-0653(04)00563-3

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/Rao03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/Rao03
A. R. Rao:
The number of reachable pairs in a digraph. Electron. Notes Discret. Math. 15: 148-150 (2003)

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.