Results 1  10
of
3,018
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
"... The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a O(4 k kmn) time algorithm for it, the first algorithm with polynomial runtime of ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a O(4 k kmn) time algorithm for it, the first algorithm with polynomial runtime
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
"... In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, and the objective is to determine whether there exists a vertex set O in G of size at most k such that G \ O is bipartite. Reed, Smith, and Vetta [Oper. Res. Lett., 2004] gave an algorithm for OCT with ..."
Abstract
 Add to MetaCart
In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, and the objective is to determine whether there exists a vertex set O in G of size at most k such that G \ O is bipartite. Reed, Smith, and Vetta [Oper. Res. Lett., 2004] gave an algorithm for OCT
Odd cycles in planar graphs
, 2005
"... Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the graph bipartite, that is, it meets all odd cycles in G. A packing in G is a collection of vertex disjoint odd cycles. This thesis addresses algorithmic and structural problems concerning odd cycle covers ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the graph bipartite, that is, it meets all odd cycles in G. A packing in G is a collection of vertex disjoint odd cycles. This thesis addresses algorithmic and structural problems concerning odd cycle covers
Quantum field theory on noncommutative spaces
"... A pedagogical and selfcontained introduction to noncommutative quantum field theory is presented, with emphasis on those properties that are intimately tied to string theory and gravity. Topics covered include the WeylWigner correspondence, noncommutative Feynman diagrams, UV/IR mixing, noncommuta ..."
Abstract

Cited by 397 (26 self)
 Add to MetaCart
A pedagogical and selfcontained introduction to noncommutative quantum field theory is presented, with emphasis on those properties that are intimately tied to string theory and gravity. Topics covered include the WeylWigner correspondence, noncommutative Feynman diagrams, UV/IR mixing
On the Small Cycle Transversal of Planar Graphs
"... We consider the problem of finding a kedge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, referred to as Small Cycle Transversal, is known to be NPcomplete. We present a polynomialtime algorithm that computes a linea ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider the problem of finding a kedge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, referred to as Small Cycle Transversal, is known to be NPcomplete. We present a polynomialtime algorithm that computes a
Results 1  10
of
3,018