Titlebook: ;

capsaicin

Finding and counting small induced subgraphs efficiently,es in the graph and .(..) is the time needed to perform a fast matrix multiplication. The second algorithm can be implemented to run in ., where . is the number of edges in the graph..We present a new algorithm for the recognition of diamond-free graphs that can be implemented to run in time ...We a

率直

On the isomorphism of graphs with few P4s, some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations and the leaves are basic graphs with a simple structure. The paper extends and generalizes re

conifer

A dynamic algorithm for line graph recognition,of finding . for a given . was already optimally solved by .[7] and .[11]. Here we present a new dynamic solution to this problem, where we can add or delete a node . in . in time proportional to the size of its adjacency list.

FORGO

Planarization of graphs embedded on surfaces, degree . and orientable genus ., then there exists a planarizing set of .(√.) edges. This result is tight within a constant factor. Similar results are obtained for planarizing vertex sets and for graphs embedded on nonorientable surfaces. Planarizing edge and vertex sets can be found in . time, if

Cytology

assent

高調(diào)

A uniform approach to graph rewriting: The pullback approach,n described by a specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison mu

Chameleon

Visualizing two- and three-dimensional models of meristematic growth,em development has been extensively studied in the literature. This paper presents several two- and three-dimensional map and cellwork L-system models that simulate patterns described by Lück and Lück [11]. The advantage of these models over their predecessors is that, through the use of a geometric

清楚說(shuō)話

Graph-theoretical methods to construct entity-relationship databases,ata are modelled as entity and relationship types. Usually relationship types come along with certain restrictions that influence the structure of databases. Cardinality constraints are the most commonly used class of constraints used to model such restrictions. Database instances satisfying given c

Amylase

On Interval Routing Schemes and treewidth,how that for each fixed .≥1, the class of graphs allowing such routing schemes is closed under minor-taking in the domain of connected graphs, and hence has a linear time recognition algorithm. This result connects the theory of compact routing with the theory of graph minors and treewidth..We also