Skip to search formSkip to main contentSkip to account menu

Biased graph

In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a large data graph. In some… 
2016
2016
We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical… 
2013
2013
Dynamic load balancing is a mandatory feature for parallel software whose workload evolves with time, such as solvers… 
2012
2012
In order to solve the problem of geometric distortion and low efficiency in the process of biased skeleton trim,a new algorithm… 
2012
2012
A biased graph is a graph with a distinguished set of circles, such that if two circles in the set are contained in a theta graph… 
2002
2002
We provide a new class of matrices, called binet matrices (de noted byB), which guarantee half-integral vertices for the… 
1992
1992
schemes and configurations the misprediction for the WB class dominates—destructive aliasing is not the major concern. There is…