Comments for My Brain is Open
http://kintali.wordpress.com
Computational Complexity, Polyhedral Combinatorics, Algorithms and Graph TheoryFri, 17 Oct 2014 18:46:47 +0000hourly1http://wordpress.com/Comment on Held Karp Relaxation by Lei
http://kintali.wordpress.com/2009/07/03/held-karp-relaxation/#comment-1853
Fri, 17 Oct 2014 18:46:47 +0000http://kintali.wordpress.com/?p=143#comment-1853Many literature state that Held-Karp Relaxation of TSP can be solved in polynomial time, for example, by the ellipsoid method. But I always doubt whether it is feasible to obtain an HK result in polynomial time in reality. Because there are exponential number of constraints, is it easy to enumerate all subsets? Or, maybe this formulation can be solved in polynomial time, but cannot be written down in polynomial time?
]]>Comment on NP intersect coNP by Paul Rio
http://kintali.wordpress.com/2010/06/06/np-intersect-conp/#comment-1843
Mon, 06 Oct 2014 15:30:41 +0000http://kintali.wordpress.com/?p=390#comment-1843Thanks KINTALI for your post…
Could you answer me the following question, please?
If L1 is NP-complete and L2 is co-NP-complete, Is it true that L1 intersection L2 is DP-complete?
I saw that question in Papadimitriouâ€™s Computational Complexity Book, but I don’t know the answer.
Thanks!!!
]]>Comment on Graceful Tree Conjecture by Miggy
http://kintali.wordpress.com/2009/06/23/graceful-tree-conjecture/#comment-1832
Mon, 22 Sep 2014 16:55:02 +0000http://kintali.wordpress.com/?p=126#comment-1832Hello! I am conducting a thesis paper about graceful labeling, and this page has been a great help to me. I also searched the internet for articles or PDF’s on practical uses of Graceful labeling. All I could found was about radio astronomy, circuit design, and X-ray crystallography, but I failed to find specific examples for this matter. Can you provide some examples on these fields? I would be very grateful if you could.
]]>Comment on NP intersect coNP by Reasons to believe $P ne NP cap coNP$ (or not) | Question and Answer
http://kintali.wordpress.com/2010/06/06/np-intersect-conp/#comment-1426
Fri, 09 May 2014 09:26:25 +0000http://kintali.wordpress.com/?p=390#comment-1426[…] It seems that many people believe that $P ne NP cap coNP$, in part because they believe that factoring is not polytime solvable. (Shiva Kintali has listed a few other candidate problems here). […]
]]>Comment on Directed Minors III. Directed Linked Decompositions by Wordpress Blog Post On Directed Minors III. Directed Linked Decompositions - Wordpress Blogs .NET
http://kintali.wordpress.com/2014/02/03/directed-minors-iii-directed-linked-decompositions/#comment-1393
Sun, 16 Mar 2014 13:13:26 +0000http://kintali.wordpress.com/?p=988#comment-1393[…] Directed Minors III. Directed Linked Decompositions February 3rd, 2014 — “This is a short post about the following paper in my directed minor series : Shiva Kintali. “Directed Minors III. Directed Linked Decompositions“. Preprint available on mypublications page. Thomas [Tho'90] proved that every undirected graph admits a linked tree decomposition of width equal to its treewidth.This theorem is a key technical tool for proving that […]” […]
]]>Comment on List Coloring of Planar Graphs by Suyash Garg
http://kintali.wordpress.com/2009/06/17/list-coloring-of-planar-graphs/#comment-1385
Fri, 07 Mar 2014 05:20:27 +0000http://kintali.wordpress.com/?p=117#comment-1385is there any algorithm exist for list coloring of planer graph?
]]>Comment on Hardness of Graph Isomorphism by Jarod Benowitz
http://kintali.wordpress.com/2010/09/02/hardness-of-graph-isomorphism/#comment-1373
Sun, 02 Feb 2014 21:19:35 +0000http://kintali.wordpress.com/?p=443#comment-1373I’m presenting a proof that GI is in P on tuesday. It was an accidental discovery (if it is correct) and began with finding an analogue to Feynman’s Path Integral on graphs.
]]>Comment on Graceful Diameter-6 Trees by Open problems for 2014 | My Brain is Open
http://kintali.wordpress.com/2013/05/06/graceful-diameter-6-trees/#comment-1364
Wed, 01 Jan 2014 18:05:51 +0000http://kintali.wordpress.com/?p=928#comment-1364[…] 1. Combinatorics : Prove that trees with diameter 6 are graceful. (see earlier posts graceful tree conjecture, graceful diameter-6 trees). […]
]]>Comment on Graceful Tree Conjecture by Open problems for 2014 | My Brain is Open
http://kintali.wordpress.com/2009/06/23/graceful-tree-conjecture/#comment-1363
Wed, 01 Jan 2014 18:05:49 +0000http://kintali.wordpress.com/?p=126#comment-1363[…] Combinatorics : Prove that trees with diameter 6 are graceful. (see earlier posts graceful tree conjecture, graceful diameter-6 […]
]]>Comment on Forbidden Directed Minors and Kelly-width by kintali
http://kintali.wordpress.com/2013/08/08/forbidden-directed-minors-and-kelly-width/#comment-1340
Fri, 06 Dec 2013 02:36:43 +0000http://kintali.wordpress.com/?p=955#comment-1340In my paper available at arxiv.org/abs/1308.5170 , there is an operation called “Source Contraction”. Using this operation we can show that your counterexamples are well-quasi-ordered.
]]>