Back to Results
First PageMeta Content
Dense graph / Minor / Matroid theory / Structural rigidity / Shortest path problem / Pseudoforest / Edge coloring / Graph theory / Graph coloring / Laman graph


CCCG 2011, Toronto ON, August 10–12, 2011 Rigid components in fixed-lattice and cone frameworks∗ Matthew Berardi† Brent Heeringa‡
Add to Reading List

Document Date: 2011-08-06 04:11:14

Open Document

File Size: 358,36 KB

Share Result on Facebook

City

London / /

/

Facility

Temple University / Williams College / York University / /

IndustryTerm

greedy algorithms / combinatorial algorithms / industrial applications / linear time algorithm / pebble game algorithm / greedy algorithm / theoretical tool / /

Organization

Temple University / Edmonds Matroid Union / York University / Department of Computer Science / Williams College / /

Person

David Eppstein / Chris Thompson / Bernd Schulze / Justin Malestein† Louis Theran / Elissa Ross / Matthew Berardi† Brent Heeringa / /

Position

G. General / /

ProgrammingLanguage

E / /

PublishedMedium

Nature Materials / /

Technology

Edmonds Matroid Union algorithm / following algorithm / Ross graph Decision algorithm / time algorithm / greedy algorithm / ESA / faster Decision algorithms / linear time algorithm / pebble game algorithm / Decision algorithm / /

URL

http /

SocialTag