The NP-completeness of finding A-trails in Eulerian Graphs and of finding Spanning Trees in Hypergraphs

Publikation: Bog/antologi/afhandling/rapport › Rapport › Forskning

Originalsprog	Engelsk

Udgivelsessted	Aalborg
Forlag	Institut for Elektroniske Systemer, Aalborg Universitet
Antal sider	15
Status	Udgivet - 1990

AUB Link

@book{6643af109f0b11db8ed6000ea68e967b,

title = "The NP-completeness of finding A-trails in Eulerian Graphs and of finding Spanning Trees in Hypergraphs",

author = "Andersen, {Lars D{\o}vling} and Herbert Fleischner",

year = "1990",

language = "English",

series = "Research Report Series",

publisher = "Institut for Elektroniske Systemer, Aalborg Universitet",

number = "R-90-03",

address = "Denmark",

}

TY - RPRT

T1 - The NP-completeness of finding A-trails in Eulerian Graphs and of finding Spanning Trees in Hypergraphs

AU - Andersen, Lars Døvling

AU - Fleischner, Herbert

PY - 1990

Y1 - 1990

M3 - Report

T3 - Research Report Series

BT - The NP-completeness of finding A-trails in Eulerian Graphs and of finding Spanning Trees in Hypergraphs

PB - Institut for Elektroniske Systemer, Aalborg Universitet

CY - Aalborg

ER -