Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
On the complexity of the vector connectivity problem
Ferdinando Cicalese, Martin Milanič, Romeo Rizzi, 2015, original scientific article

Found in: ključnih besedah
Summary of found: ...vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs, ...
Keywords: vector connectivity, APX-hardness, NP-hardness, polynomial-time algorithm, block graphs
Published: 03.04.2017; Views: 622; Downloads: 22
URL Full text (0,00 KB)

2.
Nove karakterizacije v strukturni teoriji grafov
Tatiana Romina Hartinger, 2017, doctoral dissertation

Found in: ključnih besedah
Summary of found: ...graph, interval graph, circular arc graph, cograph, block-cactus graph, cobipartite graph, K4-minor-free graph, outerplanar graph,... ...orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph,...
Keywords: 1-perfectly orientable graph, structural characterization of families of graphs, chordal graph, interval graph, circular arc graph, cograph, block-cactus graph, cobipartite graph, K4-minor-free graph, outerplanar graph, graph product, Cartesian product, lexicographic product, direct product, strong product, price of connectivity, cycle transversal, path transversal
Published: 09.11.2017; Views: 580; Downloads: 10
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica