Skip to search formSkip to main content
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

Related topics

Related topics

7 relations
Bicircular matroidDowling geometryGain graphGraph (discrete mathematics)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Biased graph walks for RDF graph embeddings
Knowledge Graphs have been recognized as a valuable source for background information in many data mining, information retrieval… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
2012
2012
Matroids of Gain Graphs in Applied Discrete Geometry
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
  • figure 1
2012
2012
Algorithm of biased skeleton trim based on intersecting cortical model
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
Prime number races with three or more competitors
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
Using Encyclopedic Knowledge for Automatic Topic Identification
This paper presents a method for automatic topic identification using an encyclopedic graph derived from Wikipedia. The system is… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 5
Highly Cited
2009
Highly Cited
2009
Topic Identification Using Wikipedia Graph Centrality
This paper presents a method for automatic topic identification using a graph-centrality algorithm applied to an encyclopedic… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
2003
2003
Biased graphs IV: Geometrical realizations
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
  • table 8.1
  • table 8.2
1995
1995
Biased Graphs .III. Chromatic and Dichromatic Invariants
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
Biased graphs. II. The three matroids
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
Biased graphs. I. Bias, balance, and gains
A biased graph is a graph together with a class of cirles (simple closed paths), called balanced, such that no theta subgraph… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE