Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

The monadic second-order logic of graphs : Definable sets of finite graphs: Label: en
Graph-theoretic properties compatible with graph derivations: Label: en
NC-algorithms for graphs with small treewidth: Label: en
A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited: Label: en
Voronoi diagrams in the moscow metric: Label: en
A time-optimal parallel algorithm for the computing of Voronoi-diagrams: Label: en
On paths in search or decision trees which require almost worst-case time: Label: en
On the spanning trees of weighted graphs: Label: en
Bandwidth and profile minimization: Label: en
O(n2) algorithms for graph planarization: Label: en
The average size of ordered binary subgraphs: Label: en
On the estimate of the size of a directed graph: Label: en
Application of graph theory to topology generation for logic gates: Label: en
A parallel algorithm for channel routing: Label: en
An efficient parallel algorithm for the all pairs shortest path problem: Label: en
Separating a polyhedron by one translation from a set of obstacles: Label: en
Dominance in the presence of obstacles: Label: en
(Time × space)-efficient implementations of hlerarchical conceptual models: Label: en
Construction of deterministic transition graphs from dynamic integrity constraints: Label: en
A graph-based decomposition approach for recursive query processing: Label: en
Transitive closure algorithms for very large databases: Label: en
Serializable graphs: Label: en
DFS tree construction: Algorithms and characterizations: Label: en
Fault tolerant networks of specified diameter: Label: en
On systems of equations defining infinite graphs: Label: en
Two algorithms for finding rectangular duals of planar graphs: Label: en
Improved bounds for the crossing numbers on surfaces of genus g: Label: en
Graph ear decompositions and graph embeddings: Label: en
Linear layouts of generalized hypercubes: Label: en
An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages: Label: en
Prefix graphs and their applications: Label: en
Time-optimal tree computations on sparse meshes: Label: en
Exponential time analysis of confluent and boundary eNCE graph languages: Label: en
Using programmed graph rewriting for the formal specification of a configuration management system: Label: en
Specification of graph translators with triple graph grammars: Label: en
Cartesian products of graphs as spanning subgraphs of de Bruijn graphs: Label: en
Minimum vertex cover, distributed decision-making, and communication complexity: Label: en
GLB-closures in directed acyclic graphs and their applications: Label: en
Dominoes: Label: en
Complexity of graph covering problems: Label: en
On domination elimination orderings and domination graphs: Label: en
The algorithmic use of hypertree structure and maximum neighbourhood orderings: Label: en
Multilevel graph grammars: Label: en
A declarative approach to graph based modeling: Label: en
Tree-width and path-width of comparability graphs of interval orders: Label: en
A lower bound for treewidth and its consequences: Label: en
Domino treewidth: Label: en
Fully dynamic maintenance of vertex cover: Label: en
Average case analysis of fully dynamic connectivity for directed graphs: Label: en
On-line graph algorithms for incremental compilation: Label: en