Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Work
Year: 2011
Type: article
Source: Journal of Discrete Algorithms
Cites: 23
Cited by: 54
Related to: 10
FWCI: 5.81
Citation percentile (by year/subfield): 91.68
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze