메뉴 건너뛰기





Volumn , Issue , 1997, Pages 20-23

Efficient parallel algorithms on distance-hereditary graphs (Extended abstract)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE; SET THEORY; TREES (MATHEMATICS);

EID: 0030714517     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (12)
  • Reference 정보가 존재하지 않습니다.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.