Cycle decomposition (graph theory)

Known as: Cycle decomposition 
In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2017
051019842017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we examine the results of GDP trend-cycle decompositions from the estimation of bivariate unobserved components… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2014
2014
The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2014
2014
Despite patients with Alzheimer's disease (AD) were reported of revealing gait disorders and balance problems, there is still… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
MOTIVATION The prediction of RNA 3D structures from its sequence only is a milestone to RNA function analysis and prediction. In… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2012
2012
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
A cycle decomposition of a graph Γ is a set C of cycles of Γ such that every edge of Γ belongs to exactly one cycle in C. Such a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Recent work on trend-cycle decompositions for US real GDP yields the following puzzling features: methods based on Unobserved… (More)
  • table A.1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2001
2001
Let Sn denote the symmetric group of degree n. If 6 ⊆ Sn , then let OMq(6), ODq(6), Œq(6) denote the number of elements in 6… (More)
Is this relevant?
1998
1998
in this paper, we prove that the wrapped Butterfly graph WBF(d; n) of degree d and dimension n is decomposable into Hamilton… (More)
  • figure 4
Is this relevant?