Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,221
Edge Insertion for Optimal Triangulations
"... Edge insertion iteratively improves a triangulation of a finite point set in R² by adding a new edge, deleting old edges crossing the new edge, and retriangulating the polygonal regions on either side of the new edge. This paper presents an abstract view of the edge insertion paradigm, and then show ..."
Abstract
-
Cited by 27 (3 self)
- Add to MetaCart
Edge insertion iteratively improves a triangulation of a finite point set in R² by adding a new edge, deleting old edges crossing the new edge, and retriangulating the polygonal regions on either side of the new edge. This paper presents an abstract view of the edge insertion paradigm
Planarity testing and optimal edge insertion with embedding constraints
, 2008
"... The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-of-the-art planar drawing algorithms. However, many practical applications have additional constraints on the drawings tha ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
embedding constraints. In the case that G is ec-planar, we provide a linear time algorithm for computing the corresponding ec-embedding. Otherwise, an ec-planar subgraph is computed. The critical part is to re-insert the deleted edges subject to the embedding constraints so that the number of crossings
Advances in the Planarization Method: Effective Multiple Edge Insertions
"... Abstract. The planarization method is the strongest known method to heuristically find good solutions to the general crossing number problem in graphs: starting from a planar subgraph, one iteratively inserts edges, representing crossings via dummy nodes. In the recent years, several improvements bo ..."
Abstract
- Add to MetaCart
Abstract. The planarization method is the strongest known method to heuristically find good solutions to the general crossing number problem in graphs: starting from a planar subgraph, one iteratively inserts edges, representing crossings via dummy nodes. In the recent years, several improvements
USING CUTTING EDGE INSERTS FOR TURNING OF CONSTRUCTION STEEL
"... Abstract Nowadays, modern manufacturing plants are equipped with CNC machines and machining machines working with high cutting conditions with automatic changes associated with setting tools, cooling and synchronization of operating production processes. All this puts great emphasis on tools that m ..."
Abstract
- Add to MetaCart
that must be highly reliable, affordable and cost effective. Considering the cutting edge is the most important part of the tool, there should be paid proper attention to material selection of the edge. The actual machining process, productivity and cost cutting depends on the cutting edge.
PREDICTION OF SOUND GENERATION FROM FLOW FIELD OF AXISYMMETRIC JET WITH CIRCULAR PLATE EDGE INSERTED IN THE SHEAR FLOW
"... Aerodynamic sound is generated from an axisymmetric jet with a plate having a circular hole inserted into the shear layer, which is sometimes called a hole tone. The velocity field was measured by a hot wire anemometry, the position of which was traversed by a stepping motor controlled by a microcom ..."
Abstract
- Add to MetaCart
Aerodynamic sound is generated from an axisymmetric jet with a plate having a circular hole inserted into the shear layer, which is sometimes called a hole tone. The velocity field was measured by a hot wire anemometry, the position of which was traversed by a stepping motor controlled by a
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks
, 1998
"... Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complex ..."
Abstract
-
Cited by 251 (11 self)
- Add to MetaCart
, a contiguous region of the network -- and we distinguish between edge routers and core routers. Edge routers maintain per flow state; they estimate the incoming rate of each flow and insert a label into each packet header based on this estimate. Core routers maintain no per flow state; they use
ON EDGE-CONNECTIVITY OF INSERTED GRAPHS
"... Abstract. The aim of this paper is to estimate the edge-connectivity of the inserted graph with the help of the degree of vertices of the inserted graph and the edge-connectivity of the original graph. 1. ..."
Abstract
- Add to MetaCart
Abstract. The aim of this paper is to estimate the edge-connectivity of the inserted graph with the help of the degree of vertices of the inserted graph and the edge-connectivity of the original graph. 1.
Inserting an Edge Into a Planar Graph
- Algorithmica
, 2000
"... Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which ..."
Abstract
-
Cited by 20 (10 self)
- Add to MetaCart
in which the given edge e can be inserted with the minimum number of crossings. Many problems concerned with the optimization over the set of all combinatorial embeddings of a planar graph turned out to be NP-hard. Surprisingly, we found a conceptually simple linear time algorithm based on SPQR
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
, 1992
"... The grammar problem, a generalization of the single-source shortest-path problem introduced by Knuth, is to compute the minimum-cost derivation of a terminal string from each non-terminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract
-
Cited by 139 (1 self)
- Add to MetaCart
to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edge-length changes.
Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree
- JOURNAL OF THE ACM
, 1997
"... Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log² n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two ..."
Abstract
-
Cited by 154 (7 self)
- Add to MetaCart
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log² n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two
Results 1 - 10
of
1,221
