set theory/ reduced constantssimple cycle graph separationmaximal planar graphvertex setnon negative weights/ B0250 Combinatorial mathematics C1160 Combinatorial mathematicsIf G is an n vertex maximal planar graph and δ≤1 3, then the vertex set of G can be partitioned into three sets A, B, ...
Therefore, a Graph- ics object is always available when you override a component's paint() and update() methods. You can ask for the graphics context of a Component by calling Component.getGraphics(). However, many components do not have a drawable graphics context. Canvas and Container ...
APIs don't conform to a rigorous graph-theory system such ascom.google.common.graph, which would allow fun things like applying lookup/cycle-detection algorithms in a very generalized way. This would be a cadillac feature - it's not clear that the cost of wrapping the innards of mavenModel...
CREATE GRAPH; CREATE VERTEX AT GRAPH <Graph ID>; JOIN VERTEX <Vertex1 ID> AND <Vertex2 ID>; DISJOIN VERTEX <Vertex1 ID> AND <Vertex2 ID>; HAS CYCLE AT GRAPH <Graph ID>; HAS PATH AT VERTEX <Vertex1 ID> AND <Vertex2 ID> AT GRAPH <Graph ID>; HAS SPANNINGTREE AT GRAPH <Graph...
Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F.: Preclusivity and simple graphs: the n-cycle and n-path Cases. In: Y. Yao, Q. Hu, H. Yu, J. Grzymala-Busse (Eds.), RSFDGrC 2015. LNCS, vol. 9437, Springer, Heidelberg (2015)...
摘要: We give a simple proof of the following fundamental result independently dueto Fary (1948) and Wagner (1936): Every plane graph has a drawing in whichevery edge is straight. 关键词: Computational Geometry DOI: 10.48550/arXiv.cs/0505047 被引量: 2 年份: 2005 收藏...
Periodic stimulation of the system is modeled as a perturbation of magnitude \(b\) away from the unit cycle, which leads to an instantaneous resetting of the phase of the oscillator, as determined by the following phase resetting curve:
In the last section, we present a new sufficient condition for graphs to have a Hamiltonian cycle, which gives us some interesting corollaries for graphs with forbidden paths. 展开 关键词: Exponential time algorithms Exact algorithms Graph algorithms Forbidden paths Hamiltonian cycles 会议名称: ...
The advantage is demonstrated by a simulation of NSFnet comparing blocking probability of a distribution computed by this ILP vs. a Hamiltonian p-Cycle which is a capacity optimal way to protect the network. 展开 关键词: graph theory integer programming linear programming optical fibre networks ...
Acircle(‘circuit’,‘cycle’)isthegraphofaclosedpath. ThesignofawalkW=e 1 e 2 ···e l istheproductofits edgesigns: σ(W):=σ(e 1 )σ(e 2 )···σ(e l ). Thus,awalkiseitherpositiveornegative. Fundamentalfactaboutasignedgraph: Thesignsofthecircles. 6 signedgraphs:balance Asubg...