Pages that link to "Item:Q1813977"

From MaRDI portal

← Fixed edge-length graph drawing is NP-hard (Q1813977)

Jump to:navigation, search

The following pages link to Fixed edge-length graph drawing is NP-hard (Q1813977):

Displaying 1 item.

On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q1813977"