222 search results - page 13 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
121
click to vote
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
127
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
130
click to vote
CORR
2009
Springer
14 years 11 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
130
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
115
click to vote
CIE
2007
Springer
15 years 7 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....