書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: labile 時間: 2025-3-21 20:20
NC-algorithms for graphs with small treewidth,l time, when restricted to graphs with treewidth ≤ . constant. From the results in this paper, it follows that most of these problems are also in NC, when restricted to graphs with treewidth bounded by a constant.作者: nutrition 時間: 2025-3-22 00:33
https://doi.org/10.1007/978-4-431-55714-2 graphs from temporal formulae in a bottom-up way corresponding to the formula structure. These graphs ensure at least provisional admissibility of system behaviour up to a present state and at most potential admissibility of future behaviour. Moreover, deterministic graphs have considerable advantages over general transition graphs.作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-22 04:34
Molecular Pathology in Clinical Practice.) time. Further, an algorithm is presented which finds the next collision between .-gons moving on lines at constant speed in time .(..) for a constant .>0 using linear space. Finally, more practical collision detection algorithms are sketched based on neighborhood information which, however, do not guarantee a nontrivial worst-case time bound.作者: dissent 時間: 2025-3-22 11:40 作者: cloture 時間: 2025-3-22 16:06
Construction of deterministic transition graphs from dynamic integrity constraints, graphs from temporal formulae in a bottom-up way corresponding to the formula structure. These graphs ensure at least provisional admissibility of system behaviour up to a present state and at most potential admissibility of future behaviour. Moreover, deterministic graphs have considerable advantages over general transition graphs.作者: cloture 時間: 2025-3-22 18:04
Moving regular ,-gons in contact,.) time. Further, an algorithm is presented which finds the next collision between .-gons moving on lines at constant speed in time .(..) for a constant .>0 using linear space. Finally, more practical collision detection algorithms are sketched based on neighborhood information which, however, do not guarantee a nontrivial worst-case time bound.作者: legacy 時間: 2025-3-22 21:13
Epsilon-nets for halfplanes,e extreme, our solution is optimal and it can be found in O(nlogn) time. If the red points are allowed to be any elements of P, our result is almost optimal: There are point sets requiring at least 2[1/.]-2 red points. The both bounds differ at most by one.作者: 有特色 時間: 2025-3-23 03:40 作者: 吞吞吐吐 時間: 2025-3-23 06:10 作者: 褻瀆 時間: 2025-3-23 13:39
https://doi.org/10.1007/978-94-007-4945-0s had a common adjacent uncoloured vertex. This multigraph was then coloured using at most 5 colours and our "nice" set of vertices was chosen using this colouring. For more details, see [14]. We are indebted to an anonymous referee for pointing out Luby‘s technique and thus speeding up the algorithm considerably.作者: Acupressure 時間: 2025-3-23 15:25 作者: Interferons 時間: 2025-3-23 21:53
Separating a polyhedron by one translation from a set of obstacles,lem which is: determine all directions in which a convex polyhedron can be separated from a set of convex obstacles. Our results are obtained by avoiding the standard technique of motion planning problems, the Ω(..) time computation of the Minkowski differences of the polyhedra.作者: antidepressant 時間: 2025-3-24 02:01 作者: 褻瀆 時間: 2025-3-24 02:53 作者: yohimbine 時間: 2025-3-24 08:19 作者: 抒情短詩 時間: 2025-3-24 10:59
https://doi.org/10.1007/978-3-642-77894-0 by forbidden configurations. It follows that the monadic second order theory of a context-free set of graphs is decidable, and that every graph property expressible in monadic second-order logic is decidable in polynomial time for graphs of a given maximal tree-width.作者: ALERT 時間: 2025-3-24 16:08
Molecular Origins of Brain and Body Geometryll the graphs in which every spanning tree is a . tree. These graphs are called .. The characterization we present shows that a large variety of graphs are not ., and therefore the following question is naturally raised: . We give an algorithm to answer this question in linear (.(|.|)) time.作者: Preserve 時間: 2025-3-24 21:21
A. Cittadini,R. Baserga,D. Cordan, that uses .(log .) time and .(..) processors on a CRCW PRAM. Also, we give a parallel algorithm that transforms a given tree-decomposition of a graph . with treewidth . to another tree-decomposition of . with treewidth ≤ 3.+2, such that the tree in this tree-decomposition is binary and has logari作者: disrupt 時間: 2025-3-24 23:41
https://doi.org/10.1007/978-3-319-53082-6t the property holds just in case the property (or a related property) holds for some specific subgraphs determined by the fibres of the derivation. On the one hand, this leads to proper tests of compatible properties. On the other hand, compatible properties turn out to be decidable for the corresp作者: Outmoded 時間: 2025-3-25 07:11 作者: Heart-Attack 時間: 2025-3-25 10:50
Molecular Origins of Brain and Body Geometrye . involves, beside traversing the graph, constructing a special structured tree, called a .. In this paper, we give a complete characterization of all the graphs in which every spanning tree is a . tree. These graphs are called .. The characterization we present shows that a large variety of graph作者: 聯(lián)合 時間: 2025-3-25 14:22 作者: 無辜 時間: 2025-3-25 16:48 作者: 猜忌 時間: 2025-3-25 22:55 作者: GEM 時間: 2025-3-26 01:40
https://doi.org/10.1007/978-4-431-55714-2se integrity constraints are specified by means of temporal logic. Monitoring temporal formulae in state sequences can be reduced to following paths in transition graphs by only checking nontemporal edge labels in each state. This paper presents an algorithm how to construct deterministic transition作者: 充氣女 時間: 2025-3-26 07:19 作者: LEVY 時間: 2025-3-26 11:08
Sunil R. Lakhani,Stephen B. Foxich a convex polyhedron can be translated through a planar convex polygonal window. The algorithm runs in linear time. This is a considerable improvement over the previous .(..log.) time algorithm of [17], where . is the total number of vertices in the objects. The second algorithm computes, in .(.)作者: 軌道 時間: 2025-3-26 15:51 作者: 一致性 時間: 2025-3-26 18:38 作者: 招致 時間: 2025-3-26 23:58
https://doi.org/10.1007/978-3-319-41761-5pen halfplane that contains more than . · |P| of the points in P also contains at least one red point..It is shown that it always suffices to colour [2/.]-1 points red (independent of the size of P). If .<2/3, we can choose these [2/.]-1 points among the extreme points of P. If all red points must b作者: 墊子 時間: 2025-3-27 01:37 作者: rectocele 時間: 2025-3-27 09:20 作者: 木質(zhì) 時間: 2025-3-27 13:13 作者: Debrief 時間: 2025-3-27 13:54 作者: Fracture 時間: 2025-3-27 20:30
DFS tree construction: Algorithms and characterizations,e . involves, beside traversing the graph, constructing a special structured tree, called a .. In this paper, we give a complete characterization of all the graphs in which every spanning tree is a . tree. These graphs are called .. The characterization we present shows that a large variety of graph作者: 娘娘腔 時間: 2025-3-27 21:58 作者: myelography 時間: 2025-3-28 06:04 作者: indemnify 時間: 2025-3-28 07:04 作者: 細胞 時間: 2025-3-28 13:54
Construction of deterministic transition graphs from dynamic integrity constraints,se integrity constraints are specified by means of temporal logic. Monitoring temporal formulae in state sequences can be reduced to following paths in transition graphs by only checking nontemporal edge labels in each state. This paper presents an algorithm how to construct deterministic transition作者: 割公牛膨脹 時間: 2025-3-28 15:02 作者: BILL 時間: 2025-3-28 19:11 作者: 平靜生活 時間: 2025-3-29 02:45 作者: forbid 時間: 2025-3-29 05:33
Moving regular ,-gons in contact,rajectories of the circles for a system of one degree of freedom is given, by replacing the circles by translationally moving regular .-gons. The approximation yields trajectories that are piecewise linear. The next linear generation of the . trajectories are found by an incremental algorithm in .(.作者: LAPSE 時間: 2025-3-29 07:19 作者: PRO 時間: 2025-3-29 13:06
Colouring perfect planar graphs in parallel, the problem of constructing a planar drawing of a planar graph is in NC; in particular, this problem can be solved in O(log. n) time using O(n) processors on a CREW PRAM..The original version of this algorithm bypassed the construction of the randomized algorithm, by using a different method of sel作者: 史前 時間: 2025-3-29 18:51
,(Time × space)-efficient implementations of hlerarchical conceptual models,作者: Collected 時間: 2025-3-29 21:54
Molecular Origins of Human Attentions, where some data items may be accessed by several read and write steps in an arbitrary fashion, and those involving nested transactions. The main graph-theoretic properties used in these characterizations are a directed cutset matching property and graph contraction.作者: 噱頭 時間: 2025-3-30 01:06 作者: AVOW 時間: 2025-3-30 05:46
https://doi.org/10.1007/978-3-7091-1416-2ing query evaluation. Augmenting the database by the edges of the skeleton graph speeds up the evaluation of the auxiliary queries for arbitrary constants ‘c’..The second technique refines the decomposition approach by a further clustering technique using some special knowledge about the structure o作者: Statins 時間: 2025-3-30 10:41
https://doi.org/10.1007/978-0-387-33227-7finding a feasible solution for a general system of algebraic inequalities of bounded degree. Next, we derive a linear time algorithm for the test on congruence by a rotation around a fixed center. Finally, if we allow an arbitrarily small but fixed range of uncertainty, we obtain a linear time algo作者: BOLUS 時間: 2025-3-30 15:20 作者: Common-Migraine 時間: 2025-3-30 17:01
Transitive closure algorithms for very large databases,losure algorithms: algebraic manipulation, implementation of the join operator, reusage of newly generated tuples, enforcement of some ordering of tuples, blocking of adjacency lists, tuning and preprocessing, taking advantage of topological order, and selection of an access structure for adjacency 作者: inscribe 時間: 2025-3-30 23:22 作者: 債務(wù) 時間: 2025-3-31 01:46 作者: arthroplasty 時間: 2025-3-31 05:34 作者: 易受騙 時間: 2025-3-31 09:31
https://doi.org/10.1007/978-3-642-87536-6We construct directed graphs of specified diameter. We are especially interested in the minimal number of arcs required to construct 2-connected digraphs. Classes of graphs considered are unconstrained digraphs, digraphs without cycles of length 2, and digraphs with fixed indegree and outdegree.作者: 潛伏期 時間: 2025-3-31 15:09 作者: crescendo 時間: 2025-3-31 19:09
Molecular Pathology of Nerve and MuscleAn algorithm to find all bridges of an undirected graph on a mesh-connected processor array is presented. Asymptotically it has the same complexity in terms of time and space as the best previous known algorithm, the one of [1]. But it has a significantly simpler structure and therefore, it gains a constant factor of about two in time.作者: 束以馬具 時間: 2025-4-1 01:04
On systems of equations defining infinite graphs,A framework is described in which we can solve equations and systems of equations on oriented edge labelled hypergraphs with a finite sequence of distinguished sources. We show that this cannot be done with the standard order-theoretic methods, but implies the use of some category-theoretic tools and results.作者: Mri485 時間: 2025-4-1 02:47 作者: 無能的人 時間: 2025-4-1 07:01
Greedy triangulation can be efficiently implemented in the average case,Let . be a set of . points uniformly distributed in a unit square. We show that the greedy triangulation of . can be computed in .(.log..) expected time (without bucketing). The best previously known upper-bound on the expected-time performance of an algorithm for the greedy triangulation was .(..).作者: 語言學(xué) 時間: 2025-4-1 11:17 作者: myalgia 時間: 2025-4-1 15:14
Graph-Theoretic Concepts in Computer Science978-3-540-46076-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: charisma 時間: 2025-4-1 21:18
https://doi.org/10.1007/978-3-319-53082-6t the property holds just in case the property (or a related property) holds for some specific subgraphs determined by the fibres of the derivation. On the one hand, this leads to proper tests of compatible properties. On the other hand, compatible properties turn out to be decidable for the corresponding graph languages, i.e., the questions
