An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs

Identifier:nobleid.org/w1/20260515/38D2CE5D

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/38D2CE5D.svg?ark=w1%2F20260515%2F38D2CE5D)](https://nobleid.org/work/w1/20260515/38D2CE5D)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Hirotoshi Honma

Shigeru Masuyama

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy