"The Lexicographically First Maximal Subgraph Problems: P-Completeness and ..."

Satoru Miyano (1987)

Details and statistics

DOI: 10.1007/3-540-18088-5_36

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics