Filters
DAG-width - Connectivity Measure for Directed Graphs
Tree-width is a very useful connectivity measure for undirected graphs. We propose a new definition, called DAG-width, for directed graphs which measures how of bounded DAG-width. A comparison of DAG-width with tre...
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Algorithmic applications of linear rank-width
-width. Several articles have recently shown that the so-called rank-width parameter restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard not only on graphs ...
BD - Teorie informace
- 2010 •
- O
Rok uplatnění
O - Ostatní výsledky
Thread graphs, linear rank-width and their algorithmic applications
-width. Several articles have recently shown that the so-called rank-width parameter restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard on graphs of bounde...
IN - Informatika
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Width Parameters Beyond Tree-width and Their Applications
Besides the very successful concept of tree-width (see [H.~Bodlaender algorithms. Our presented novel look at the contemporary developments of these ``width'' parameters in combinatorial structures delivers --- besides traditional t...
IN - Informatika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A Parametrized Algorithm for Matroid Branch-Width
Branch-width is a structural parameter very closely related to tree-width an algorithm that, for a given matroid M of bounded branch-width t which is represented over afinite field, finds a branch decomposition of M of ...
IN - Informatika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Matroids in theoretical CS
Matroids are combinatorial structures extending the notion of graphs. We study mainly width parameters on matroids, like branch-width or tree-width....
BD - Teorie informace
- 2005 •
- A
Rok uplatnění
A - Audiovizuální tvorba
Matroid Tree-Width
We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended.) We prove that the tree-width of a graphic matroid is equal to that of...
BA - Obecná matematika
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Twin-Width is Linear in the Poset Width
Twin-width is a new parameter informally measuring how diverse is that FO model checking on graph classes of bounded twin-width is in FPT. With that result, they also claimed that posets of bounded width have bounded twin-<...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Ultimate service states - Calculation of crack width and deflection
Ultimate service states - Calculation of crack width and deflection Ultimate service states - Calculation of crack width and deflection Ultimate service states - Calculation of crack width and deflection Ultimate service st...
JM - Inženýrské stavitelství
- 2014 •
- D
Rok uplatnění
D - Stať ve sborníku
Width parameters of graphs and matroids
We will review some known "width" parameters of graphs, and relate them to matroids. In particular, we use matroids to introduce a vertex-free definition of graph tree-width, and we show how matroid branch-width is related ...
BD - Teorie informace
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 5 724