[PDF][PDF] Various properties of various ultrafilters, various graph width parameters, and various connectivity systems
T Fujita - arXiv preprint arXiv, 2024 - researchgate.net
This paper investigates ultrafilters in the context of connectivity systems, defined as pairs (X,
f) where X is a finite set and f is a symmetric submodular function. Ultrafilters, essential in …
f) where X is a finite set and f is a symmetric submodular function. Ultrafilters, essential in …
[PDF][PDF] A tourist guide through treewidth
HL Bodlaender - Acta cybernetica, 1993 - cyber.bibl.u-szeged.hu
A short overview is given of many recent results in algorithmic graph theory that deal with the
notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions …
notions treewidth, and pathwidth. We discuss algorithms that find tree-decompositions …
Treewidth: Algorithmic techniques and results
HL Bodlaender - … Symposium on Mathematical Foundations of Computer …, 1997 - Springer
This paper gives an overview of several results and techniques for graphs algorithms that
compute the treewidth of a graph or that solve otherwise intractable problems when …
compute the treewidth of a graph or that solve otherwise intractable problems when …
[PDF][PDF] Parameterized complexity: A framework for systematically confronting computational intractability
In this paper we give a programmatic overview of parameterized computational complexity
in the broad context of the problem of coping with computational intractability. We give some …
in the broad context of the problem of coping with computational intractability. We give some …
[图书][B] Mathematical linguistics
A Kornai - 2007 - books.google.com
Mathematical Linguistics introduces the mathematical foundations of linguistics to computer
scientists, engineers, and mathematicians interested in natural language processing. The …
scientists, engineers, and mathematicians interested in natural language processing. The …
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
A Linhares, HH Yanasse - Computers & Operations Research, 2002 - Elsevier
The minimization of open stacks problem (MOSP) arises on the sequencing of a set of
cutting patterns in order to minimize the maximum number of open stacks around the cutting …
cutting patterns in order to minimize the maximum number of open stacks around the cutting …
Extended finite state models of language
A Kornai - Natural Language Engineering, 1996 - cambridge.org
In spite of the wide availability of more powerful (context free, mildly context sensitive, and
even Turing-equivalent) formalisms, the bulk of the applied work on language and …
even Turing-equivalent) formalisms, the bulk of the applied work on language and …
[PDF][PDF] Algorithms for graphs of small treewidth
B de Fluiter - the Dutch Network of Operations Research, 1997 - core.ac.uk
In this paper I give an overview of my PhD thesis, entitled Algorithms for Graphs of Small
Treewidth (ISBN 90-393-1528-0). This thesis was completed under supervision of Dr. Hans …
Treewidth (ISBN 90-393-1528-0). This thesis was completed under supervision of Dr. Hans …
[HTML][HTML] Defensive alliances in graphs of bounded treewidth
B Bliem, S Woltran - Discrete Applied Mathematics, 2018 - Elsevier
Abstract The Defensive Alliance problem has been studied extensively during the last fifteen
years, but the question whether it is FPT when parameterized by treewidth has still remained …
years, but the question whether it is FPT when parameterized by treewidth has still remained …
The structure and number of obstructions to treewidth
S Ramachandramurthi - SIAM Journal on Discrete Mathematics, 1997 - SIAM
For each pair of nonadjacent vertices in a graph, considerthe greater of the degrees of the
two vertices. The minimum of these maxima is a lower bound on the treewidth of a graph …
two vertices. The minimum of these maxima is a lower bound on the treewidth of a graph …