56 citations · 83 across the 10 of their papers we have counts for
10 papers
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
James M. Shook, Isabel Beichl
For a digraph , a set is said to be a feedback vertex set (FVS) if is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scal…
Connected equitably -colorable realizations with -factors
James M. Shook
A graph is said to be equitably -colorable if its vertices can be partitioned into independent sets that pairwise differ in size by at most one. Chen, Lih, and Wu conjec…
Packing a Degree Sequence Realization With A Graph
James M. Shook
Two simple -vertex graphs and , with respective maximum degrees and , are said to pack if is isomorphic to a subgraph of the complement of…
a characterization of the centers of chordal graphs
James M Shook, Bing Wei
A graph is -chordal if it does not have an induced cycle with length greater than . We call a graph chordal if it is -chordal. Let be a graph. The distance between the…
On a conjecture that strengthens Kundu's -factor Theorem
James M. Shook
Let be a non-increasing degree sequence with even . In 1974, Kundu showed that if is graphic, then some re…
Maximally Edge-Connected Realizations and Kundu's -factor Theorem
James M. Shook
A simple graph with edge-connectivity and minimum degree is maximally edge connected if . In 1964, given a non-increasing degree sequence $π=(d_{1},\ld…
A Taxonomic Approach to Understanding Emerging Blockchain Identity Management Systems
Loic Lesavre, Priam Varin, Peter Mell +2
Identity management systems (IDMSs) are widely used to provision user identities while managing authentication, authorization, and data sharing within organizations and on the web.…
Smart Contract Federated Identity Management without Third Party Authentication Services
Peter Mell, Jim Dray, James Shook
Federated identity management enables users to access multiple systems using a single login credential. However, to achieve this a complex privacy compromising authentication has t…
Cryptocurrency Smart Contracts for Distributed Consensus of Public Randomness
Peter Mell, John Kelsey, James Shook
Most modern electronic devices can produce a random number. However, it is difficult to see how a group of mutually distrusting entities can have confidence in any such hardware-pr…
Threshold Digraphs
Brian Cloteaux, M. Drew LaMar, Elizabeth Moseman +1
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degr…