共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
In this paper, we consider a problem on the reachability of a version of graph-rewriting system. It deals with 3-regular graphs with states for the vertices. They differ from ordinary graphs so that a cyclic order of the edges is assigned on each vertex. Graphs are rewritten with a rule set of graph rewriting. For any two such connected graphs with at least four vertices of distinct states, we show that there exists a rule set that rewrites one to the other. 相似文献
4.
《国际计算机数学杂志》2012,89(3):468-475
The distance-two labelling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labelling of a graph G is an assignment of non-negative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and non-consecutive integers. The L(2, 1)-labelling number of G, denoted by λ(G), is the smallest integer k such that G has a L(2, 1)-labelling in which no label is greater than k. In this work, we study the L(2, 1)-labelling problem on block graphs. We find upper bounds for λ(G) in the general case and reduce those bounds for some particular cases of block graphs with maximum clique size equal to 3. 相似文献
5.
运用某些存取结构与连通图之间的关系,将参与者人数为8的一类存取结构转化为连通图中顶点数为8的一类共110种图存取结构,进而研究了最优信息率及其所对应的完善秘密共享方案的构造。对其中101种图存取结构的最优信息率的精确值进行计算,并讨论了达到此信息率的秘密共享方案的具体构造方法;对余下9种存取结构的最优信息率的上下界进行计算,并证明了顶点数为8的信息率的上界。 相似文献
6.
Efficiently searching top-k representative vertices is crucial for understanding the structure of large dynamic graphs. Recent studies show that communities formed by a vertex with high local clustering coefficient and its neighbours can achieve enhanced information propagation speed as well as disease transmission speed. However, local clustering coefficient, which measures the cliquishness of a vertex in its local neighbourhood, prefers vertices with small degrees. To remedy this issue, in this paper we propose a new ranking measure, weighted clustering coefficient (WCC) of vertices, by integrating both local clustering coefficient and degree. WCC not only inherits the properties of local clustering coefficient but also approximately measures the density (i.e., average degree) of its neighbourhood subgraph. Thus, vertices with higher WCC are more likely to be representative. We study efficiently computing and monitoring top-k representative vertices based on WCC over large dynamic graphs. To reduce the search space, we propose a series of heuristic upper bounds for WCC to prune a large portion of disqualifying vertices from the search space. We also develop an approximation algorithm by utilizing Flajolet-Martin sketch to trade acceptable accuracy for enhanced efficiency. An efficient incremental algorithm dealing with frequent updates in dynamic graphs is explored as well. Extensive experimental results on a variety of real-life graph datasets demonstrate the efficiency and effectiveness of our approaches. 相似文献
7.
8.
膨胀图(Expander graphs, EG) 理论与压缩感知(Compressive sensing, CS)理论相结合是近几年发展起来的一个新方向, 其优点在于能设计出具有确定结构的0-1测量矩阵, 且可根据膨胀图的结构协同设计重建算法, 相当于在重建算法中引入了先验知识, 能更快更准确地重构出稀疏信号. 本文从非均匀采样的必要性和合理性分析出发, 在已有的膨胀图压缩感知理论基础上, 将膨胀图的定义拓展到左顶点度数不相等的边膨胀图, 并建立起边膨胀图邻接矩阵与有限等距性质 (Restricted isometry property, RIP)条件之间的联系, 又进一步给出了边膨胀图邻接矩阵的列相关系数的上限值. 同时根据边膨胀图的特性, 协同设计了两种压缩感知重建算法. 通过仿真实验对比边膨胀图代表的非均匀采样模式与现有膨胀图代表的均匀采样模式, 以及本文设计的算法与传统算法在重建稀疏信号上的性能, 实验结果验证了边膨胀图压缩感知理论的有效性. 相似文献
9.
Richa Bansal Kamal Srivastava 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(2):397-412
The cyclic antibandwidth problem is to embed the vertices of a graph G of n vertices on a cycle C
n
such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. Exact results/conjectures for this
problem exist in the literature for some standard graphs, such as paths, cycles, two-dimensional meshes, and tori, but no
algorithm has been proposed for the general graphs in the literature reviewed by us so far. In this paper, we propose a memetic
algorithm for the cyclic antibandwidth problem (MACAB) that can be applied on arbitrary graphs. An important feature of this
algorithm is the use of breadth first search generated level structures of a graph to explore a variety of solutions. A novel
greedy heuristic is designed which explores these level structures to label the vertices of the graph. The algorithm achieves
the exact cyclic antibandwidth of all the standard graphs with known optimal values. Based on our experiments we conjecture
the cyclic antibandwidth of three-dimensional meshes, hypercubes, and double stars. Experiments show that results obtained
by MACAB are substantially better than those given by genetic algorithm. 相似文献
10.
We study the problem of reconstructing unknown graphs under the additive combinatorial search model. The main result concerns
the reconstruction of bounded degree graphs, i.e., graphs with the degree of all vertices bounded by a constant d . We show that such graphs can be reconstructed in O(dn) nonadaptive queries, which matches the information-theoretic lower bound. The proof is based on the technique of separating
matrices. A central result here is a new upper bound for a general class of separating matrices. As a particular case, we
obtain a tight upper bound for the class of d -separating matrices, which settles an open question stated by Lindstr?m in [20]. Finally, we consider several particular
classes of graphs. We show how an optimal nonadaptive solution of O(n
2
/ log n) queries for general graphs can be obtained. We also prove that trees with unbounded vertex degree can be reconstructed in
a linear number of queries by a nonadaptive algorithm.
Received August 1997; revised January 1999. 相似文献
11.
A. V. Panyukov 《Automation and Remote Control》2004,65(3):439-448
Algorithms for the Steiner problem and its generalizations on large graphs with a relatively small number of terminal vertices are designed by a two-level solution scheme: a network topology (i.e., a tree determining the adjacency of terminal vertices and branching points) is determined in the upper level and the optimal location for branching points with the topology found in the upper level is determined in the lower level. 相似文献
12.
Loukas Georgiadis Stavros D. Nikolopoulos Leonidas Palios 《Theory of Computing Systems》2014,55(2):347-379
For a given collection \(\mathcal{G}\) of directed graphs we define the join-reachability graph of \(\mathcal{G}\) , denoted by \(\mathcal{J}(\mathcal{G})\) , as the directed graph that, for any pair of vertices u and v, contains a path from u to v if and only if such a path exists in all graphs of \(\mathcal{G}\) . Our goal is to compute an efficient representation of \(\mathcal{J}(\mathcal{G})\) . In particular, we consider two versions of this problem. In the explicit version we wish to construct the smallest join-reachability graph for \(\mathcal{G}\) . In the implicit version we wish to build an efficient data structure, in terms of space and query time, such that we can report fast the set of vertices that reach a query vertex in all graphs of \(\mathcal{G}\) . This problem is related to the well-studied reachability problem and is motivated by emerging applications of graph-structured databases and graph algorithms. We consider the construction of join-reachability structures for two graphs and develop techniques that can be applied to both the explicit and the implicit problems. First we present optimal and near-optimal structures for paths and trees. Then, based on these results, we provide efficient structures for planar graphs and general directed graphs. 相似文献
13.
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms
for these problems. For an input graph G on n vertices and m edges, our algorithms run in O(n + m2) time and require O(n m) space; we thus provide a solution to the open problem posed by Hayward et al. asking for an O(n4)-time algorithm for finding holes in arbitrary graphs. The key element of the algorithms is the use of the depth-first-search
traversal on appropriate auxiliary graphs in which moving between any two adjacent vertices is equivalent to walking along
a P4 (i.e., a chordless path on four vertices) of the input graph or on its complement, respectively. The approach can be generalized
so that for a fixed constant k ≥ 5 we obtain an O(nk-1)-time algorithm for the detection of a hole (antihole resp.) on at least k vertices.
Additionally, we describe a different approach which allows us to detect antiholes in graphs that do not contain chordless
cycles on five vertices in O(n + m2) time requiring O(n + m) space.
Again, for a fixed constant k ≥ 6, the approach can be extended to yield O(nk-2)-time and O(n2)-space algorithms for detecting holes (antiholes resp.) on at least k vertices in graphs which do not contain holes (antiholes
resp.) on k - 1 vertices. Our algorithms are simple and can be easily used in practice. Finally, we also show how our detection
algorithms can be augmented so that they return a hole or an antihole whenever such a structure is detected in the input graph;
the augmentation takes O(n + m) time and space. 相似文献
14.
Hongju Cheng Naixue Xiong Larence T. Yang Young-Sik Jeong 《The Journal of supercomputing》2008,45(1):105-128
In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The
problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all
their one-hop neighbors in the assigned time-slot(s). And, the objective is to minimize the cycle length, i.e., the total
number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this
problem is proved to be K
2 in arbitrary graphs (Chlamtac and Pinter in IEEE Trans. Comput. C-36(6):729–737, 1987) and 25K in unit disk graphs () with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different
control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for
wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the
two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this
case, we have proved that the upper bound can be (4K−2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the
conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc.
And, a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict
with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize.
Simulations are also done to verify the performance of these algorithms. 相似文献
15.
Bertossi A.A. Pinotti C.M. Tan R.B. 《Parallel and Distributed Systems, IEEE Transactions on》2003,14(3):222-235
Given an integer /spl sigma/>1, a vector (/spl delta//sub 1/, /spl delta//sub 2/,..., /spl delta//sub /spl sigma/-1/), of nonnegative integers, and an undirected graph G=(V, E), an L(/spl delta//sub 1/, /spl delta//sub 2/,..., /spl delta//sub /spl sigma/-1/)-coloring of G is a function f from the vertex set V to a set of nonnegative integers, such that |f(u)-f(v)|/spl ges//spl delta//sub i/, if d(u,v)=i, for 1相似文献
16.
In a majority conversion process, the vertices of a graph can be in one of the two states, colored or uncolored, and these states are dynamically updated so that a vertex becomes colored at a certain time period if at least half of its neighbors were in the colored state in the previous time period. A dynamic monopoly is a set of vertices in a graph that when initially colored will eventually cause all vertices in the graph to become colored. This paper establishes a connection between dynamic monopolies and the well-known feedback vertex sets which are sets of vertices whose removal results in an acyclic graph. More specifically, we show that dynamic monopolies and feedback vertex sets are equivalent in graphs wherein all vertices have degree 2 or 3. We use this equivalence to provide exact values for the minimum size of dynamic monopolies of planar hexagonal grids, as well as upper and lower bounds on the minimum size of dynamic monopolies of cylindrical and toroidal hexagonal grids. For these last two topologies, the respective upper and lower bounds differ by at most one. 相似文献
17.
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. Based on probabilistic averages, we define a measure of such coherence generating power (CGP) for a generic quantum channel, based on the average coherence generated by the quantum channel acting on a uniform ensemble of incoherent states. Explicit analytical formula of the CGP for any unitary channels are presented in terms of subentropy. An upper bound for CGP of unital quantum channels has been also derived. Detailed examples are investigated. 相似文献
18.
David Emms Author VitaeAuthor Vitae Edwin R. Hancock Author Vitae 《Pattern recognition》2009,42(5):985-1002
We consider how continuous-time quantum walks can be used for graph matching. We focus in detail on both exact and inexact graph matching, and consider in depth the problem of measuring graph similarity. We commence by constructing an auxiliary graph, in which the two graphs to be matched are co-joined by a layer of indicator vertices (one for each potential correspondence between a pair of vertices). We simulate a continuous-time quantum walk in parallel on the two graphs. The layer of connecting indicator vertices in the auxiliary graph allow quantum interference to take place between the two walks. The interference amplitudes on the indicator vertices are determined by differences in the two walks, and can be used to calculate probabilities for matches between pairs of vertices from the graphs. By applying the Hungarian (Kuhn-Munkres) algorithm to these probabilities, we recover a correspondence mapping between the graphs. To calculate graph similarity, we combine these probabilities with edge-consistency information to give a consistency measure. Based on the consistency measure, we define two graph similarity measures, one of which requires correspondence matches while the second does not. We analyse our approach experimentally using synthetic and real-world graphs. This reveals that our method gives results that are intermediate between the most sophisticated iterative techniques available, and simpler less complex ones. 相似文献
19.
Caelli T Kosinov S 《IEEE transactions on pattern analysis and machine intelligence》2004,26(4):515-519
In this paper, we show how inexact graph matching (that is, the correspondence between sets of vertices of pairs of graphs) can be solved using the renormalization of projections of the vertices (as defined in this case by their connectivities) into the joint eigenspace of a pair of graphs and a form of relational clustering. An important feature of this eigenspace renormalization projection clustering (EPC) method is its ability to match graphs with different number of vertices. Shock graph-based shape matching is used to illustrate the model and a more objective method for evaluating the approach using random graphs is explored with encouraging results. 相似文献