About the Competition and Phylogeny Number of Graphs
M. Uebe. Institute of Mathematics of the University of Lübeck, Lübeck, Germany, Study Thesis, (2007)
Zusammenfassung
In this thesis, the concepts competition and phylogeny number of graphs getting motivated. An implementation calculates the competition graph for a given di-graph, the acyclic di-graph and its competition number for a given competition sub-graph.
%0 Thesis
%1 uebe2007about
%A Uebe, Marcus
%C Lübeck, Germany
%D 2007
%K myown
%T About the Competition and Phylogeny Number of Graphs
%X In this thesis, the concepts competition and phylogeny number of graphs getting motivated. An implementation calculates the competition graph for a given di-graph, the acyclic di-graph and its competition number for a given competition sub-graph.
@mastersthesis{uebe2007about,
abstract = {In this thesis, the concepts competition and phylogeny number of graphs getting motivated. An implementation calculates the competition graph for a given di-graph, the acyclic di-graph and its competition number for a given competition sub-graph.},
added-at = {2013-12-03T11:09:47.000+0100},
address = {Lübeck, Germany},
author = {Uebe, Marcus},
biburl = {https://www.bibsonomy.org/bibtex/22e3c32758102e3ee90590f247e02592c/mnitsche},
interhash = {28669fe295be383a8542cf9d848518bd},
intrahash = {2e3c32758102e3ee90590f247e02592c},
keywords = {myown},
school = {{Institute of Mathematics of the University of Lübeck}},
timestamp = {2014-01-10T14:55:27.000+0100},
title = {{About the Competition and Phylogeny Number of Graphs}},
type = {Study Thesis},
year = 2007
}