Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Pathwidth")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 38

  • Page / 2
Export

Selection :

  • and

Pagenumber of pathwidth-k graphs and strong pathwidth-k graphsTOGASAKI, Mitsunori; YAMAZAKI, Koichi.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 361-368, issn 0012-365X, 8 p.Article

Embeddings of k-connected graphs of pathwidth kGUPTA, Arvind; NISHIMURA, Naomi; PROSKUROWSKI, Andrzej et al.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 242-265, issn 0166-218X, 24 p.Article

Approximation of pathwidth of outerplanar graphsBODLAENDER, Hans L; FOMIN, Fedor V.Journal of algorithms (Print). 2002, Vol 43, Num 2, pp 190-200, issn 0196-6774Article

The treewidth and pathwidth of hypercubesCHANDRAN, L. Sunil; KAVITHA, T.Discrete mathematics. 2006, Vol 306, Num 3, pp 359-365, issn 0012-365X, 7 p.Article

Edge and node searching problems on treesPENG, S.-L; HO, C.-W; HSU, T.-S et al.Theoretical computer science. 2000, Vol 240, Num 2, pp 429-446, issn 0304-3975Article

The structure of obstructions to treewidth and pathwidthCHLEBIKOVA, Janka.Discrete applied mathematics. 2002, Vol 120, Num 1-3, pp 61-71, issn 0166-218XConference Paper

Treewidth and pathwidth of permutation graphsBODLAENDER, H. L; KLOKS, T; KRATSCH, D et al.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 4, pp 606-616, issn 0895-4801Article

Arbres et largeur linéaire des graphes = Trees and Pathwidth of graphsIkorong Annouk, Gilbert; Duchet, Pierre.1992, 119 p.Thesis

Cutwidth I : A linear time fixed parameter algorithmTHILIKOS, Dimitrios M; SEMA, Maria; BODLAENDER, Hans L et al.Journal of algorithms (Print). 2005, Vol 56, Num 1, pp 1-24, issn 0196-6774, 24 p.Article

A simple linear-time algorithm for finding path-decompositions of small widthCATTELL, K; DINNEEN, M. J; FELLOWS, M. R et al.Information processing letters. 1996, Vol 57, Num 4, pp 197-203, issn 0020-0190Article

On the pathwidth of chordal graphsGUSTEDT, J.Discrete applied mathematics. 1993, Vol 45, Num 3, pp 233-248, issn 0166-218XConference Paper

The stable set problem and the thinness of a graphMANNINO, Carlo; ORIOLO, Gianpaolo; RICCI, Federico et al.Operations research letters. 2007, Vol 35, Num 1, pp 1-9, issn 0167-6377, 9 p.Article

Narrowness, pathwidth, and their application in natural language processingKORNAI, A; TUZA, Z.Discrete applied mathematics. 1992, Vol 36, Num 1, pp 87-92, issn 0166-218XArticle

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex DeletionCYGAN, Marek; PILIPCZUK, Marcin; PILIPCZUK, Michat et al.Algorithmica. 2012, Vol 64, Num 1, pp 170-188, issn 0178-4617, 19 p.Article

Edge searching weighted graphsYASAR, Öznur; DYER, Danny; PIKE, David A et al.Discrete applied mathematics. 2009, Vol 157, Num 8, pp 1913-1923, issn 0166-218X, 11 p.Article

On the interval completion of chordal graphsPENG, Sheng-Lung; CHEN, Chi-Kang.Discrete applied mathematics. 2006, Vol 154, Num 6, pp 1003-1010, issn 0166-218X, 8 p.Article

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsBODLAENDER, H. L; FELLOWS, M. R; HALLETT, M. T et al.Theoretical computer science. 2000, Vol 244, Num 1-2, pp 167-188, issn 0304-3975Article

Characterization of graphs and digraphs with small process numbersCOUDERT, David; SERENI, Jean-Sébastien.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1094-1109, issn 0166-218X, 16 p.Article

Bounds on isoperimetric values of treesSUBRAMANYA BHARADWAJ, B. V; SUNIL CHANDRAN, L.Discrete mathematics. 2009, Vol 309, Num 4, pp 834-842, issn 0012-365X, 9 p.Article

Linear-time algorithms for problems on planar graphs with fixed disk dimensionABU-KHZAM, Faisal N; LANGSTON, Michael A.Information processing letters. 2007, Vol 101, Num 1, pp 36-40, issn 0020-0190, 5 p.Article

A note on width-parameterized SAT: An exact machine-model characterizationPAPAKONSTANTINOU, Periklis A.Information processing letters. 2009, Vol 110, Num 1, pp 8-12, issn 0020-0190, 5 p.Article

Interval degree and bandwidth of a graphFOMIN, Fedor V; GOLOVACH, Petr A.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 345-359, issn 0166-218X, 15 p.Article

Embeddings of k-connected graphs of pathwidth kGUPTA, A; NISHIMURA, N; PROSKUROWSKI, A et al.Lecture notes in computer science. 2000, pp 111-124, issn 0302-9743, isbn 3-540-67690-2Conference Paper

Acyclic and star colorings of cographsLYONS, Andrew.Discrete applied mathematics. 2011, Vol 159, Num 16, pp 1842-1850, issn 0166-218X, 9 p.Conference Paper

Lower bounds on the pathwidth of some grid-like graphsELLIS, John; WARREN, Robert.Discrete applied mathematics. 2008, Vol 156, Num 5, pp 545-555, issn 0166-218X, 11 p.Article

  • Page / 2