期刊文献+
共找到115篇文章
< 1 2 6 >
每页显示 20 50 100
DISCUSSION ON MINIMUM FLOW MODEL FOR ITS RELATIONSHIP WITH HAMILTONIAN PATH PROBLEM 被引量:1
1
作者 NINGXuan-xi 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2004年第4期322-325,共4页
A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model... A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model called minimum spanning flow in a network is established to revise the old one. It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network s,t , with the unit capacity for all arcs. 展开更多
关键词 graph theory hamiltonian path spanning flow
在线阅读 下载PDF
On traceable iterated line graph and hamiltonian path index
2
作者 NIU Zhao-hong XIONG Li-ming YANG Wei-hua 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2024年第2期239-252,共14页
Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characteri... Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which L^(n)(G)has a hamiltonian path.As applications,we use this characterization to give several upper bounds on the hamiltonian path index of a graph. 展开更多
关键词 iterated line graph TRACEABLE hamiltonian index hamiltonian path index
在线阅读 下载PDF
Light-Front Hamiltonian, Path Integral and BRST Formulations of the Chern-Simons Theory under Appropriate Gauge-Fixing 被引量:6
3
作者 Usha Kulshreshtha Daya Shankar Kulshreshtha James P. Vary 《Journal of Modern Physics》 2010年第6期385-392,共8页
The Chern-Simons theory in two-space one-time dimensions is quantized on the light-front under appropriate gauge-fixing conditions using the Hamiltonian, path integral and BRST formulations.
关键词 hamiltonian QUANTIZATION path Integral QUANTIZATION BRST QUANTIZATION CHERN-SIMONS Theories LIGHT-CONE QUANTIZATION LIGHT-FRONT QUANTIZATION Constrained Dynamics Quantum Electrodynamics Models in Lower Dimensions
在线阅读 下载PDF
Light-Front Hamiltonian and Path Integral Formulations of the Conformally Gauge-Fixed Polyakov D1 Brane Action 被引量:1
4
作者 Usha Kulshreshtha Daya Shankar Kulshreshtha 《Journal of Modern Physics》 2011年第5期335-340,共6页
In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on t... In a recent paper we have studied the Hamiltonian and path integral quantizations of the conformally gauge-fixed Polyakov D1 brane action in the instant-form of dynamics using the equal world-sheet time framework on the hyperplanes defined by the world- sheet time . In the present work we quantize the same theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time , using the standard constraint quantization techniques in the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac, which is in contrast to the corresponding case of the instant-form theory, where the theory remains unconstrained in the sense of Dirac. The light-front theory is seen to possess a set of twenty six primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front. 展开更多
关键词 LIGHT-FRONT QUANTIZATION hamiltonian QUANTIZATION path Integral QUANTIZATION Constrained Dynamics Constraint QUANTIZATION GAUGE SYMMETRY STRING GAUGE SYMMETRY STRING Theory D-brane Actions Polyakov Action Light-Cone Quantization.
在线阅读 下载PDF
Establishing path integral in the entangled state representation for Hamiltonians in quantum optics
5
作者 王继锁 孟祥国 +1 位作者 冯健 高云峰 《Chinese Physics B》 SCIE EI CAS CSCD 2007年第1期23-31,共9页
Based on two mutually conjugate entangled state representations, we establish the path integral formalism for some Hamiltonians of quantum optics in entangled state representations. The Wigner operator in the entangle... Based on two mutually conjugate entangled state representations, we establish the path integral formalism for some Hamiltonians of quantum optics in entangled state representations. The Wigner operator in the entangled state representation is presented. Its advantages are explained. 展开更多
关键词 path integral hamiltonian entangled state representation
原文传递
Hamiltonian, Path Integral and BRST Formulations of the Restricted Gauge Theory of <i>QCD<sub>2</sub></i>
6
作者 Usha Kulshreshtha Daya Shankar Kulshreshtha James P. Vary 《Journal of Modern Physics》 2018年第14期2355-2369,共15页
We study the Hamiltonian, path integral and Becchi-Rouet-Stora and Tyutin (BRST) formulations of the restricted gauge theory of QCD2 à la Cho et al. under appropriate gauge-fixing conditions.
关键词 hamiltonian QUANTIZATION path Integral QUANTIZATION BRST QUANTIZATION Quantum CHROMODYNAMICS QCD2 Field Theories in Lower Dimensions Gauge-Invariant Theories Gauge-Fixing
在线阅读 下载PDF
Light-Front Hamiltonian, Path Integral and BRST Formulations of the Chern-Simons-Higgs Theory in the Broken Symmetry Phase
7
作者 Usha Kulshreshtha Daya S. Kulshreshtha James P. Vary 《Journal of Modern Physics》 2013年第4期38-48,共11页
In the present work we study the Hamiltonian, path integral and BRST formulations of the Chern-Simons-Higgs theory in two-space one-time dimensions, in the so-called broken symmetry phase of the Higgs potential (where... In the present work we study the Hamiltonian, path integral and BRST formulations of the Chern-Simons-Higgs theory in two-space one-time dimensions, in the so-called broken symmetry phase of the Higgs potential (where the phase φ(xμ) of the complex matter field Φ(xμ) carries the charge degree of freedom of the complex matter field and is akin to the Goldstone boson) on the light-front (i.e., on the hyperplanes defined by the fixed light-cone time). The theory is seen to possess a set of first-class constraints and the local vector gauge symmetry. The theory being gauge-invariant is quantized under appropriate gauge-fixing conditions. The explicit Hamiltonian and path integral quantization is achieved under the above light-cone gauges. The Heisenberg equations of motion of the system are derived for the physical degrees of freedom of the system. Finally the BRST quantization of the system is achieved under appropriate BRST gauge-fixing, where the BRST symmetry is maintained even under the BRST light-cone gauge-fixing. 展开更多
关键词 LIGHT-FRONT QUANTIZATION hamiltonian QUANTIZATION path Integral QUANTIZATION BRST QUANTIZATION Constrained Dynamics Gauge SYMMETRY Chern-Simons-Higgs Theory Broken SYMMETRY Phase HIGGS Potential Spontaneous SYMMETRY Breaking
在线阅读 下载PDF
Light-Front Hamiltonian and Path Integral Formulations of the Conformally Gauge-Fixed Polyakov D1 Brane Action with a Scalar Dilation Field
8
作者 Usha Kulshreshtha Daya Shankar Kulshreshtha 《Journal of Modern Physics》 2011年第8期826-833,共8页
Recently we have studied the instant-form quantization (IFQ) of the conformally gauge-fixed Polyakov D1 brane action with and without a scalar dilaton field using the Hamiltonian and path integral formulations in the ... Recently we have studied the instant-form quantization (IFQ) of the conformally gauge-fixed Polyakov D1 brane action with and without a scalar dilaton field using the Hamiltonian and path integral formulations in the equal world-sheet time framework on the hyperplanes defined by the world- sheet time σ0=τ=constant . The light-front quantization (LFQ) of this theory without a scalar dilaton field has also been studied by us recently. In the present work we study the LFQ of this theory in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time σ+=τ+σ=constant , using the Hamiltonian and path integral formulations. The light-front theory is seen to be a constrained system in the sense of Dirac. The light-front theory is seen to possess a set of twenty seven primary second-class contraints. In the present work Hamiltonian and path integral quantizations of this theory are studied on the light-front. 展开更多
关键词 LIGHT-FRONT QUANTIZATION hamiltonian QUANTIZATION path Integral QUANTIZATION Constrained Dynamics Constraint QUANTIZATION GAUGE SYMMETRY STRING GAUGE SYMMETRY STRING Theory D-brane Actions Polyakov Action Light-Cone QUANTIZATION
在线阅读 下载PDF
Instant-Form and Light-Front Hamiltonian and Path Integral Formulations of the Conformally Gauge-Fixed Polyakov D1-Brane Action in the Presence of a Scalar Axion Field and an <i>U</i>(1) Gauge Field
9
作者 Usha Kulshreshtha Daya S. Kulshreshtha 《Journal of Modern Physics》 2013年第4期57-69,共13页
Recently we have studied the instant-form quantization (IFQ) and the light-front quantization (LFQ) of the conformally gauge-fixed Polyakov D1 brane action using the Hamiltonian and path integral formulations. The IFQ... Recently we have studied the instant-form quantization (IFQ) and the light-front quantization (LFQ) of the conformally gauge-fixed Polyakov D1 brane action using the Hamiltonian and path integral formulations. The IFQ is studied in the equal world-sheet time framework on the hyperplanes defined by the world-sheet time σ0=τ=constant and the LFQ in the equal light-cone world-sheet time framework, on the hyperplanes of the light-front defined by the light-cone world-sheet time σ+= (τ+σ) =constant. The light-front theory is seen to be a constrained system in the sense of Dirac in contrast to the instant-form theory. However, owing to the gauge anomalous nature of these theories, both of these theories are seen to lack the usual string gauge symmetries defined by the world-sheet reparametrization invariance (WSRI) and the Weyl invariance (WI). In the present work we show that these theories when considered in the presence of background gauge fields such as the NSNS 2-form gauge field Bαβ(σ,τ) or in the presence of U(1) gauge field Aα(σ,τ) and the constant scalar axion field C(σ,τ), then they are seen to possess the usual string gauge symmetries (WSRI and WI). In fact, these background gauge fields are seen to behave as the Wess-Zumino or Stueckelberg fields and the terms containing these fields are seen to behave as Wess-Zumino or Stueckelberg terms for these theories. 展开更多
关键词 Lagrangian and hamiltonian Approach hamiltonian QUANTIZATION path Integral QUANTIZATION LIGHT-FRONT QUANTIZATION Theory of Quantized Fields Constrained Dynamics D-Brane Actions Polyakov Action Strings and Branes String GAUGE Symmetry GAUGE FIELD Theories
在线阅读 下载PDF
树的3-路图的Hamiltonian性
10
作者 徐军 王朝瑞 《北京理工大学学报》 EI CAS CSCD 1993年第4期447-449,共3页
一个图G的k-路图P_k(G)是指以G的长为(K-1)的路为点集.在P_K(G)中两个点邻接当且仅当其并是G的长为k的路或长为k的圈.本文解决了H.J.Broersma和C.Hoede提出的两个关于3-路图的猜想:①若树T满足Δ(T)≥4,则其3-路图P_3(T)是非Hamiltonian... 一个图G的k-路图P_k(G)是指以G的长为(K-1)的路为点集.在P_K(G)中两个点邻接当且仅当其并是G的长为k的路或长为k的圈.本文解决了H.J.Broersma和C.Hoede提出的两个关于3-路图的猜想:①若树T满足Δ(T)≥4,则其3-路图P_3(T)是非Hamiltonian的.②若G是单圈图,且Δ(G)≥5,则其3-路图P_3(G)是非Hamiltonian的。 展开更多
关键词 k-路图 单圈图 哈密顿图
在线阅读 下载PDF
PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS 被引量:6
11
作者 刘敏 刘红美 《Acta Mathematica Scientia》 SCIE CSCD 2013年第1期227-246,共20页
Let Qn,k (n 〉 3, 1 〈 k ≤ n - 1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty ve... Let Qn,k (n 〉 3, 1 〈 k ≤ n - 1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges, fv and fe be the numbers of faulty vertices and faulty edges, respectively. In this paper, we give three main results. First, a fault-free path P[u, v] of length at least 2n - 2fv - 1 (respectively, 2n - 2fv - 2) can be embedded on Qn,k with fv + f≤ n- 1 when dQn,k (u, v) is odd (respectively, dQ,~,k (u, v) is even). Secondly, an Q,,k is (n - 2) edgefault-free hyper Hamiltonianaceable when n ( 3) and k have the same parity. Lastly, a fault-free cycle of length at least 2n - 2fv can be embedded on Qn,k with f~ 〈 n - 1 and fv+f≤2n-4. 展开更多
关键词 enhanced hypercube fault-tolerant embedding paths embedding cycles em-bedding hamiltonian-laceability
在线阅读 下载PDF
Longest Hamiltonian in N<sub>odd-</sub>Gon
12
作者 Blanca I. Niel 《Open Journal of Discrete Mathematics》 2013年第2期75-82,共8页
We single out the polygonal paths of nodd -1 order that solve each of the different longest non-cyclic Euclidean Hamiltonian path problems in networks by an arithmetic algorithm. As by product, the procedure determine... We single out the polygonal paths of nodd -1 order that solve each of the different longest non-cyclic Euclidean Hamiltonian path problems in networks by an arithmetic algorithm. As by product, the procedure determines the winding index of cyclic Hamiltonian polygonals on the vertices of a regular polygon. 展开更多
关键词 hamiltonian path Extremal Problems Euclidean Geometric PROBLEM Farthest Neighbor Tours Traveling SALESMAN PROBLEM Geometry of ODD Regular Polygons
在线阅读 下载PDF
计算最短公共超串的贪婪算法 被引量:4
13
作者 申时凯 吴绍兵 +2 位作者 申浩如 王付艳 管彦庆 《计算机工程与设计》 CSCD 北大核心 2007年第8期1757-1758,1761,共3页
最短公共超串问题就是对给定的子串集合找到包含每个子串的可能的串。这个问题是一个NP-完全问题。目前已有一些方法对此进行了研究。通过对各子串的分析和研究,提出了一种近似于贪婪算法的求最短公共超串问题算法,该算法可应用于解决DN... 最短公共超串问题就是对给定的子串集合找到包含每个子串的可能的串。这个问题是一个NP-完全问题。目前已有一些方法对此进行了研究。通过对各子串的分析和研究,提出了一种近似于贪婪算法的求最短公共超串问题算法,该算法可应用于解决DNA片段组装和数据压缩问题。最后给出了几个实例。 展开更多
关键词 最短公共超串 覆盖 算法 贪婪算法 哈密尔顿路
在线阅读 下载PDF
离线手写体数字笔迹重构方法 被引量:3
14
作者 李国宏 施鹏飞 《上海交通大学学报》 EI CAS CSCD 北大核心 2005年第4期561-564,共4页
笔迹重构是从字符的静态图像中提取笔迹顺序信息,有助于将在线识别方法应用于离线识别问题,以及实现单个手写字符识别和字符序列识别方法的统一.基于笔段的笔迹重构方法中,笔迹重构实质上就是笔段的排序问题.采用基于骨骼的方法提取字... 笔迹重构是从字符的静态图像中提取笔迹顺序信息,有助于将在线识别方法应用于离线识别问题,以及实现单个手写字符识别和字符序列识别方法的统一.基于笔段的笔迹重构方法中,笔迹重构实质上就是笔段的排序问题.采用基于骨骼的方法提取字符的笔段,并根据笔段结构图构建笔段关系图;将笔迹重构视为一个全局最优问题,采用总体方向变化最小路径重构书写笔迹;该问题通过搜寻最小代价Hamilton路径来解决,等同于解所构建图中的旅行售货郎问题.在手写体数字笔迹重构实例分析的基础上,对200个字符图像进行测试的正确率是93.5%.实验结果表明,该方法对于手写体数字笔迹重构是有效的. 展开更多
关键词 手写体数字 笔迹 重构 笔段 Hamilton路径
在线阅读 下载PDF
骑士旅游问题一个猜想的证明 被引量:2
15
作者 柏森 杨晓帆 柏林 《重庆大学学报(自然科学版)》 EI CAS CSCD 1998年第5期85-89,共5页
对n×n棋盘上的骑士旅游问题进行了研究,证明了猜想:当n≥5且为偶数时,以任意点作为初始点都有解。
关键词 图论 哈密顿圈 哈密顿路 猜想/骑士旅游问题 分治
在线阅读 下载PDF
45面体的对偶图2棵树分解四着色法研究 被引量:3
16
作者 周毅 霍玉洪 《长江大学学报(自科版)(上旬)》 CAS 2010年第3期169-169,共1页
以45面体为例,将p=25,q=69,f=45的对偶图分解为2棵对偶树TA和TB,通过对对偶树TA和TB的顶点2着色,达到对图G(f,q,p)的4着色。讨论了H路径Pi的个数,森林Fi的个数,G(p,q,f)的A区和B区的划分方案数,G(p,q,f)的顶点4着色方案数。
关键词 对偶图 4着色 森林 H路径
在线阅读 下载PDF
SHP-VI:一种基于最短哈密顿通路的POMDP值迭代算法 被引量:1
17
作者 冯奇 周雪忠 +1 位作者 黄厚宽 张小平 《计算机研究与发展》 EI CSCD 北大核心 2011年第12期2343-2351,共9页
基于试探(trial-based)的值迭代算法是求解部分可观察Markov决策过程(partially observable Markov decision process,POMDP)模型的一类有效算法,其中FSVI算法是目前最快的算法之一.然而对于较大规模的POMDP问题,FSVI计算MDP值函数的时... 基于试探(trial-based)的值迭代算法是求解部分可观察Markov决策过程(partially observable Markov decision process,POMDP)模型的一类有效算法,其中FSVI算法是目前最快的算法之一.然而对于较大规模的POMDP问题,FSVI计算MDP值函数的时间是不容忽视的.提出一种基于最短哈密顿通路(shortest Hamiltonian path)的值迭代算法(shortest Hamiltonian path-based value iteration,SHP-VI).该方法用求解最短哈密顿通路问题的蚁群算法计算一条最优信念状态轨迹,然后在这些信念状态上反向更新值函数.通过与FSVI算法的实验比较,结果表明SHP-VI算法很大程度地提高了基于试探的算法计算信念状态轨迹的效率. 展开更多
关键词 部分可观察Markov决策过程 值迭代 基于点的算法 基于试探的算法 哈密顿通路
在线阅读 下载PDF
立方图的可圈性 被引量:1
18
作者 陈晶晶 胡智全 王艳 《湖北大学学报(自然科学版)》 CAS 北大核心 2009年第3期232-234,240,共4页
图的可圈性是哈密尔顿性的一个推广.设G是有向图,如果对G的每一个定向D,都存在S(D)V(G)使在D中改变所有恰与S(D)中一个顶点相关联的弧的方向后所得到的图为有向哈密尔顿图,则称G为可圈图.证明至少含5个顶点的连通图G的立方图是可圈图当... 图的可圈性是哈密尔顿性的一个推广.设G是有向图,如果对G的每一个定向D,都存在S(D)V(G)使在D中改变所有恰与S(D)中一个顶点相关联的弧的方向后所得到的图为有向哈密尔顿图,则称G为可圈图.证明至少含5个顶点的连通图G的立方图是可圈图当且仅当G不同构于任何一条偶路.该结果改进了Klostermeyer的3个定理. 展开更多
关键词 可圈性 哈密尔顿路 哈密尔顿连通 哈密尔顿图 立方图
在线阅读 下载PDF
图的哈密尔顿性的谱条件(英文) 被引量:6
19
作者 余桂东 《应用数学》 CSCD 北大核心 2014年第3期588-595,共8页
本文,我们利用补图的邻接矩阵的谱半径给出原图含有哈密尔顿路,哈密尔顿圈,以及原图是哈密尔顿-连通图的一些谱条件.
关键词 谱半径 哈密尔顿路 哈密尔顿圈 哈密尔顿-连通图
在线阅读 下载PDF
一个求简单图中所有Hamilton回路的算法 被引量:3
20
作者 文中华 陈志红 《湘潭大学自然科学学报》 CAS CSCD 北大核心 2005年第4期34-41,共8页
从Hamilton回路的定义和图的邻接矩阵的定义入手,建立了图中的初级通路的关联关系.利用长度为k的初级通路及其关联关系逐步求长度为k+1的初级通路及其关联关系的方法,求得图的所有Hamilton回路.通过理论分析,说明该算法比已有的求图的... 从Hamilton回路的定义和图的邻接矩阵的定义入手,建立了图中的初级通路的关联关系.利用长度为k的初级通路及其关联关系逐步求长度为k+1的初级通路及其关联关系的方法,求得图的所有Hamilton回路.通过理论分析,说明该算法比已有的求图的所有的Hamilton回路的算法降低了算法的复杂度,为求解Hamilton回路问题提供了新思路. 展开更多
关键词 简单图 HAMILTON回路 关联关系 初级通路
在线阅读 下载PDF
上一页 1 2 6 下一页 到第
使用帮助 返回顶部