◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benny Godlin

2 papers hereh-index 9463 citations13 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.LO1
  • math.CO1

identity via Semantic Scholar / OpenAlex

most citedA most general edge elimination graph polynomial

4 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LO2008★ 3 cited

Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas

Benny Godlin, Emilia Katz, Johann A. Makowsky

Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula…

math.CO2007★ 4 cited

A most general edge elimination graph polynomial

Ilia Averbouch, Benny Godlin, Johann A. Makowsky

We look for graph polynomials which satisfy recurrence relations on three kinds of edge elimination: edge deletion, edge contraction and deletion of edges together with their end p…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.