Work

A Study on the Topic of Crossing Minimisation

Year: 2024

Type: conference-paper

Source: International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

DOI: 10.1109/synasc65383.2024.00068

Authors: Rares-Ioan Mateiu, Alexandru Popa

Institutions: University of Bucharest, National Institute for Research and Development in Informatics - ICI Bucharest

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4407951182

FWCI:

Cites: 15

Cited by:

Related to: 10