On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs

Benatti, Haroldo G.; de Queiroz, Ruy J.G.B.

TYTUŁ ARTYKUŁU

On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs

AUTORZY: Haroldo G. Benatti, Ruy J.G.B. de Queiroz
TYTUŁ CZASOPISMA: Bulletin of the Section of Logic
WYDANIE: 2006 / Tom 35 / Numer 4
STRONY: 195 - 214
ROK: 2006
WYDAWCA: Wydawnictwo Uniwersytetu Łódzkiego
ISSN: 0138-0680

Pełny tekst tego artykułu nie jest dostępny w BazHum.

Zacytuj

CZYSTY TEKST

Haroldo G. Benatti, Ruy J.G.B. de Queiroz, On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 195 - 214

BIBTEX

Haroldo G. Benatti and Ruy J.G.B. de Queiroz. On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs. Bulletin of the Section of Logic, 35(4):195–214, 2006.

Pokaż kod BibTeX

@article{bazhum242543,
  author = {Benatti, Haroldo G. and de Queiroz, Ruy J.G.B.},
  title = {{On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs}},
  journal = {Bulletin of the Section of Logic},
  year = {2006},
  volume = {35},
  number = {4},
  pages = {195--214},
  issn = {0138-0680},
  url = {https://bazhum.muzhp.pl/articles/242543}
}