You are currently offline. Some features of the site may not work correctly.

# 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… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
• 2017
• Corpus ID: 11413629
Knowledge Graphs have been recognized as a valuable source for background information in many data mining, information retrieval… Expand
2012
2012
A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain… Expand
2012
2012
In order to solve the problem of geometric distortion and low efficiency in the process of biased skeleton trim,a new algorithm… Expand
2011
2011
Let $$q\ge 3$$ and $$2\le r\le \phi (q)$$ be positive integers, and $$a_1,\ldots ,a_r$$ be distinct reduced residue classes… Expand
Highly Cited
2009
Highly Cited
2009
• CoNLL
• 2009
• Corpus ID: 6785866
This paper presents a method for automatic topic identification using an encyclopedic graph derived from Wikipedia. The system is… Expand
Highly Cited
2009
Highly Cited
2009
• HLT-NAACL
• 2009
• Corpus ID: 851318
This paper presents a method for automatic topic identification using a graph-centrality algorithm applied to an encyclopedic… Expand
2003
2003
A gain graph is a graph whose oriented edges are labelled invertibly from a group G, the gain group. A gain graph determines a… Expand
1995
1995
Abstract A biased graph Ω consists of a graph Γ and a class of circles in Γ (edge sets of simple, closed paths), called balanced… Expand
Highly Cited
1991
Highly Cited
1991
A biased graph Ω consists of a graph Γ and a class B of circles (simple, closed paths) in Γ, called balanced circles, such that… Expand
Highly Cited
1989
Highly Cited
1989
A biased graph is a graph together with a class of cirles (simple closed paths), called balanced, such that no theta subgraph… Expand