Topic
Triangle graph
About: Triangle graph is a research topic. Over the lifetime, 64 publications have been published within this topic receiving 708 citations.
Papers published on a yearly basis
Papers
Proceedings Article•
1 Jan 1999TL;DR: A new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits is presented, based on a new encoding of the CLERS string produced by RossignacOs Edgebreaker compression.
Abstract: We present a new representation that is guaranteed to encode any planar triangle graph of V vertices in less than 3.67V bits. Our code improves on all prior solutions to this well studied problem and lies within 13% of the theoretical lower limit of the worst case guaranteed bound. It is based on a new encoding of the CLERS string produced by RossignacOs Edgebreaker compression [Rossignac99]. The elegance and simplicity of this technique makes it suitable for a variety of 2D and 3D triangle mesh compression applications. Simple and fast compression/decompression algorithms with linear time and space complexity are available.
115 citations
TL;DR: In this article, an explicit example of a one-loop triangle graph where dimensional regularization fails to regulate the infra-red singularities that emerge at intermediate steps of studying large-Q 2 Sudakov factorization is presented.
42 citations
TL;DR: In this article, the dispersive approach to the axial anomaly is revisited and the anomalous Ward identity is proved in the case of the external momenta corresponding to one real and one virtual photon.
Abstract: The dispersive approach to the axial anomaly is revisited. Considering the familiar VVA triangle graph, the anomalous Ward identity is proved in the case of the external momenta corresponding to one real and one virtual photon. We also comment on a recent claim that the anomaly pole in QCD fails to reproduce the pion pole. In this connection, it is emphasized that there is no need to introduce a massless axial meson in the chiral limit. In the framework of QCD sum rules method a constraint for the Borel transform of relevant form factors imposed by the anomaly is considered.
30 citations
TL;DR: In this paper, an explicit example of a one-loop triangle graph where dimensional regularization fails to regulate the infra-red singularities that emerge at intermediate steps of studying large-Q^2$ Sudakov factorization is presented.
Abstract: An explicit example is presented (a one-loop triangle graph) where dimensional regularization fails to regulate the infra-red singularities that emerge at intermediate steps of studying large-$Q^2$ Sudakov factorization. The mathematical nature of the phenomenon is explained within the framework of the theory of the $As$-operation.
28 citations
TL;DR: It is shown that, for general triangle graphs, the maximum independent set problem and the upper independent neighborhood set problem cannot be polynomially approximated within any fixed constant factor greater than one unless P=NP.
16 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 3 |
| 2020 | 2 |
| 2019 | 4 |
| 2018 | 3 |
| 2017 | 1 |
| 2016 | 1 |